Order-first split-second methods for vehicle routing problems: A review

Transportation Research Part C: Emerging Technologies

Volumn 40, Issue , 2014, Pages 179-200

  Prins, Christian ^a   Lacomme, Philippe ^b   Prodhon, Caroline ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Metaheuristic; Order first split second heuristic; Route first cluster second heuristic; Splitting procedure; Vehicle routing

Indexed keywords

SALES; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING; VEHICLES;

AND SPLITS; META HEURISTICS; METAHEURISTIC; ORDER-FIRST SPLIT-SECOND HEURISTIC; ROUTE-FIRST CLUSTER-SECOND HEURISTIC; SPLITTING PROCEDURE; VEHICLE CAPACITY; VEHICLE ROUTING PROBLEMS;

HEURISTIC METHODS;

CLUSTER ANALYSIS; HEURISTICS; OPTIMIZATION; TRANSPORTATION;

EID: 84894076878     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2014.01.011     Document Type: Article

References (89)

1. Afsar H.M., Prins C., Santos A.C. Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. Int. Trans. Oper. Res. 2014, 21(1):153-175.
2. Altinkemer K., Gavish B. Heuristics for delivery problems with constant error guarantees. Transport. Sci. 1990, 24:294-297.
3. Archetti C., Savelsbergh M.W.P., Speranza M.G. Worst-case analysis for split delivery vehicle routing problems. Transport. Sci. 2006, 40:226-234.
4. Badeau P., Guertin F., Gendreau M., Potvin J.-Y., Taillard E. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transport. Res. Part C: Emerg. Technol. 1997, 5(2):109-122.
5. Beasley J.E. Route-first cluster-second methods for vehicle routing. Omega 1983, 11:403-408.
6. Belenguer J.M., Benavent E., Lacomme P., Prins C. Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 2006, 33:3363-3383.
7. Belenguer J.M., Benavent E., Labadi N., Prins C., Reghioui M. Split-delivery capacitated arc routing problem: lower bound and metaheuristic. Transport. Sci. 2010, 44:206-220.
8. Bertazzi L., Bosco A., Guerriero F., Laganà D. A stochastic inventory routing problem with stock-out. Transport. Res. Part C: Emerg. Technol. 2013, 27:89-107.
9. Bettinelli A., Ceselli A., Righini G. A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transport. Res. Part C: Emerg. Technol. 2011, 19(5):723-740.
10. Beullens P., Muyldermans L., Cattrysse D., Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 2003, 147:629-643.
11. Bontoux D., Artigues C., Feillet D. A memetic algorithm with large neighborhood operator for the generalized traveling salesman problem. Comput. Oper. Res. 2010, 37:1844-1852.
12. Boudia M., Prins C., Reghioui M. An effective memetic algorithm with population management for the split-delivery vehicle routing problem. Lecture Notes in Computer Science 2007, 4771:16-30. Springer, Berlin. T. Bartz-Beielstein (Ed.).
13. Bouly H., Dang D.C., Moukrim A. A memetic algorithm for the team orienteering problem. 4OR - Quart. J. Oper. Res. 2010, 8:49-70.
14. Chang Y., Chen L. Solve the vehicle routing problem with time windows via a genetic algorithm. Discrete Contin. Dyn. Syst. Suppl. 2007, 240-249.
15. Chu F., Labadi N., Prins C. A scatter search for the periodic capacitated arc routing problem. Eur. J. Oper. Res. 2006, 169:586-605.
16. Deb K. Multi-objective Optimization using Evolutionary Algorithms 2001, Wiley, Chichester.
17. Desrochers, M., 1988. An Algorithm for the Shortest Path Problem with Resource Constraints. Technical Report G-88-27, GERAD, Montréal.
18. Duhamel C., Lacomme P., Prins C., Prodhon C. A GRASP × ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 2010, 37:1912-1923.
19. Duhamel C., Lacomme P., Quilliot A., Toussaint H. A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 2011, 38:617-640.
20. Duhamel C., Lacomme P., Prodhon C. Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 2011, 38:723-739.
21. Duhamel C., Lacomme P., Prodhon C. A hybrid evolutionary local search with depth first search split procedures for the heterogeneous vehicle routing problem. Eng. Appl. Artif. Intell. 2012, 25(2):345-358.
22. El Fallahi A., Prins C., Wolfler Calvo R. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res. 2008, 35:1725-1741.
23. Figliozzi M.A. An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transport. Res. Part C: Emerg. Technol. 2010, 18(5):668-679.
24. Fisher M.L., Jaikumar R. A generalized assignment heuristic for the vehicle routing problem. Networks 1981, 11:109-124.
25. Fleury G., Lacomme P., Prins C. Evolutionary algorithms for stochastic arc routing problems. Lecture Notes in Computer Science 2004, vol. 3005:501-512. Springer, Berlin. G.R. Raidl (Ed.).
26. Fleury G., Lacomme P., Prins C., Ramdane-Chérif W. Improving robustness of solutions to arc routing problems. J. Oper. Res. Soc. 2005, 56:526-538.
27. Fleury G., Lacomme, P., Prins, C., Sevaux, M., 2008. A Bi-objective Stochastic Approach for the Stochastic CARP. Report LIMOS RR-08-06, Blaise Pascal University, Clermont-Ferrand, France.
28. Gillett B.E., Miller L.R. A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 1974, 21:340-349.
29. Golden B., Assad A., Levy L., Gheysens F. The fleet size and mix vehicle routing problem. Comput. Oper. Res. 1984, 11:49-66.
30. Haimovich M., Rinnooy Kan A.H.G. Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 1985, 10:527-542.
31. Hamdi-Dhaoui, K., 2011. Optimisation conjointe du transport et du placement avec des contraintes de sécurité (Joint Optimization of Routing and Loading with Safety Constraints). PhD Thesis, Troyes University of Technology, France.
32. Huth T., Mattfeld D.C. Integration of vehicle routing and resource allocation in a dynamic logistics network. Transport. Res. Part C: Emerg. Technol. 2009, 17(2):149-162.
33. Imran A., Salhi S., Wassan N.A. A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur. J. Oper. Res. 2009, 197(2):509-518.
34. Jansen K. Bounds for the general capacitated routing problem. Networks 1993, 23:165-173.
35. Jozefowiez N., Semet F., Talbi E.G. Target aiming Pareto search and its application to the vehicle routing problem with route balancing. J. Heuristics 2007, 13:455-469.
36. Jozefowiez N., Semet F., Talbi E.G. An evolutionary algorithm for the vehicle routing problem with route balancing. Eur. J. Oper. Res. 2009, 195:761-769.
37. Juan A., Faulin J., Grasman S., Riera D., Marull J., Mendez C. Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transport. Res. Part C: Emerg. Technol. 2011, 19(5):751-765.
38. Kansou A., Yassine A. New upper bounds for the multi-depot capacitated arc routing problem. Int. J. Metaheurist. 2010, 1:81-95.
39. Khebbache-Hadji S., Prins C., Yalaoui A., Reghioui M. Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows. Central Eur. J. Oper. Res. 2013, 21:307-336.
40. Kindervater G.A.P., Savelsbergh M.W.P. Vehicle routing: handling edge exchanges. Local Search in Combinatorial Optimization 1997, 337-360. Wiley. E. Aarts, J.K. Lenstra (Eds.).
41. Labadi N., Prins C., Reghioui M. GRASP with path relinking for the capacitated arc routing problem with time windows. Studies in Computational Intelligence 2008, vol. 144:111-135. Springer, Berlin. A. Fink, F. Rothlauf (Eds.).
42. Labadi N., Prins C., Reghioui M. A memetic algorithm for the vehicle routing problem with time windows. RAIRO-Oper. Res. 2008, 42:415-431.
43. Labadi N., Prins C., Reghioui M. An evolutionary algorithm with distance measure for the split delivery capacitated arc routing problem. Studies in Computational Intelligence 2008, vol. 153:275-294. Springer, Berlin. C. Cotta, J. Van Hemert (Eds.).
44. Lacomme P., Prins C., Ramdane-Chérif W. Competitive genetic algorithms for the capacitated arc routing problem and its extensions. Lecture Notes in Computer Science 2001, vol. 2037:473-483. Springer, Berlin. E.J.W. Boers (Ed.).
45. Lacomme P., Prins C., Ramdane-Chérif W. Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 2004, 131:159-185.
46. Lacomme P., Prins C., Ramdane-Chérif W. Evolutionary algorithms for periodic arc routing problems. Eur. J. Oper. Res. 2005, 165:535-553.
47. Lacomme P., Prins C., Sevaux M. A genetic algorithm for a bi-objective capacitated arc routing problem. Comput. Oper. Res. 2006, 33:3473-3493.
48. Lacomme P., Toussaint H., Duhamel C. A GRASP x ELS for the vehicle routing problem with basic three-dimensional loading constraints. Eng. Appl. Artif. Intell. 2013, 26:1795-1810.
49. Laporte G., Semet F. Classical and new heuristics for the vehicle routing problem. The Vehicle Routing Problem 2002, 109-128. SIAM, Philadelphia. P. Toth, D. Vigo (Eds.).
50. Liu S., Huang W., Ma H. An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transport. Res. Part E 2009, 45:434-445.
51. Liu, R., Jiang, Z., Geng, N., Liu, T., 2010a. A heuristic approach for the open capacitated arc routing problem. In: Int. Conf. on Supply Chain Management and Information Systems (SCMIS), IEEE, 6p.
52. Liu R., Jiang Z., Liu X., Chen F. Task selection and routing problems in collaborative truckload transportation. Transport. Res. Part E 2010, 46:1071-1085.
53. Mei Y., Tang K., Yao X. A memetic algorithm for the periodic capacitated arc routing problem. IEEE Trans. Syst. Man Cybernet. - Part B 2011, 41:1654-1667.
54. Mendoza J.E., Castanier B., Gueret C., Medaglia A.L., Velasco N. A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput. Oper. Res. 2010, 37:1886-1898.
55. Mosheiov G. Vehicle routing with pick-up and delivery: tour-partitioning heuristics. Comput. Indust. Eng. 1998, 34(3):669-684.
56. Mourão M.C., Nunes A.C., Prins C. Heuristic methods for the sectoring arc routing problem. Eur. J. Oper. Res. 2009, 196:856-868.
57. Nagy G., Salhi S. A nested location-routing heuristic using route length estimation. Stud. Locational Anal. 1996, 10:109-127.
58. Ngueveu S.U., Prins C., Wolfler Calvo R. An effective evolutionary algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 2010, 37:1877-1885.
59. Nguyen V.-P., Prins C., Prodhon C. Solving the two-echelon location routing problem by a hybrid GRASP path relinking complemented by a learning process. Eur. J. Oper. Res. 2012, 216:113-126.
60. Nguyen V.-P., Prins C., Prodhon C. A multi-start iterative local search with tabu list and path relinking for the two-echelon location routing problem. Eng. Appl. Artif. Intell. 2012, 25:56-71.
61. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 2004, 31:1985-2002.
62. Prins C. Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng. Appl. Artif. Intell. 2009, 22:916-928.
63. Prins C. A GRASP×evolutionary local search hybrid for the vehicle routing problem. Studies in Computational Intelligence 2009, vol. 16:35-53. Springer, Berlin. F.B. Pereira, J. Tavares (Eds.).
64. Prins C., Bouchenoua A. A memetic algorithm solving the VRP, the CARP, and more general problems with nodes, edges and arcs. Recent advances in memetic algorithms and related search technologies 2004, 65-85. Springer, Berlin. W. Hart, N. Krasnogor, J. Smith (Eds.).
65. Prins C., Prodhon C., Calvo R.Wolfler A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. Lecture Notes in Computer Science 2006, vol. 3906:183-194. Springer, Berlin. J. Gottlieb, G.R. Raidl (Eds.).
66. Prins C., Labadi N., Reghioui M. Tour splitting algorithms for vehicle routing problems. Int. J. Prod. Res. 2009, 47:507-535.
67. Prodhon C., Prins C. A memetic algorithm with population management for the periodic location-routing problem. Lecture Notes in Computer Science 2008, vol. 5296:43-57. Springer, Berlin. M.J. Blesa (Ed.).
68. Qu Y., Bard J.F. The heterogeneous pickup and delivery problem with configurable vehicle capacity. Transport. Res. Part C: Emerg. Technol. 2013, 32:1-20.
69. Reghioui M., Prins C., Labadi N. GRASP with path relinking for the capacitated arc routing problem with time windows. Lecture Notes in Computer Science 2007, vol. 4448:722-731. Springer, Berlin. M. Giacobini (Ed.).
70. Reiter P., Gutjahr W.J. Exact hybrid algorithms for solving a bi-objective vehicle routing problem. Central Eur. J. Oper. Res. 2012, 20:19-43.
71. Renaud J., Boctor F.F., Laporte G. An improved petal heuristic for the vehicle routeing problem. J. Oper. Res. Soc. 1996, 47:329-336.
72. Repoussis P.P., Tarantilis C.D. Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transport. Res. Part C: Emerg. Technol. 2010, 18(5):695-712.
73. Ryan D.M., Hjorring C., Glover F. Extensions of the petal method for the vehicle routing. J. Oper. Res. Soc. 1993, 44:289-296.
74. Salhi S., Sari M. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. Eur. J. Oper. Res. 1997, 103:95-112.
75. Santos L., Coutinho-Rodrigues J., Current J.R. An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transport. Res. Part B 2010, 44:246-266.
76. Sörensen K. Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics. Central Eur. J. Oper. Res. 2006, 14:193-207.
77. Tang K., Mei Y., Yao X. Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans. Evol. Comput. 2009, 13:1151-1166.
78. Ulusoy G. The fleet size and mix problem for capacitated arc routing. Eur. J. Oper. Res. 1985, 22:329-337.
79. Ursani Z., Essam D., Cornforth D., Stocker R. Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 2011, 11:5375-5390.
80. Velasco N., Castagliola P., Dejax P., Guéret C., Prins C. A memetic algorithm for a pick-up and delivery problem by helicopter. Studies in Computational Intelligence 2009, vol. 161:173-190. Springer, Berlin. F.B. Pereira, J. Tavares (Eds.).
81. Velasco N., Dejax P., Guéret C., Prins C. A non-dominated sorting genetic algorithm for a bi-objective pickup and delivery problem. Eng. Optim. 2012, 44:305-325.
82. Vidal T., Crainic T.G., Gendreau M., Lahrichi N., Rei W. A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Oper. Res. 2012, 60(3):611-624.
83. Vidal T., Crainic T.G., Gendreau M., Prins C. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Comput. Oper. Res. 2013, 40(1):475-489.
84. Vidal T., Crainic T.G., Gendreau M., Prins C. A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 2013, doi 10.1016/j.ejor.2013.09.045.
85. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C., 2014. Implicit depot assignments and rotations in vehicle routing heuristics. Eur. J. Oper. Res., http://dx.doi.org/10.1016/j.ejor.2013.12.0442014.
86. Villegas J.G., Prins C., Prodhon C., Medaglia A.L., Velasco N. GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng. Appl. Artif. Intell. 2010, 23(5):780-794.
87. Villegas J.G., Prins C., Prodhon C., Medaglia A.L., Velasco N. GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 2011, 38(9):1319-1334.
88. Wøhlk S. An approximation algorithm for the capacitated arc routing problem. Open Oper. Res. J. 2008, 2:8-12.
89. Xing L., Rohlfshagen P., Chen Y., Yao X. An evolutionary approach to the multi-depot capacitated arc routing problem. IEEE Trans. Evol. Comput. 2010, 14:356-374.