A survey of genetic algorithms for solving multi depot vehicle routing problem

Applied Soft Computing Journal

Volumn 27, Issue , 2015, Pages 519-532

  Karakatič, Sašo ^a   Podgorelec, Vili ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Evolutionary algorithms; Genetic algorithms; Transport optimization; Vehicle routing problem

Indexed keywords

EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; ROUTING ALGORITHMS; SURVEYS; VEHICLE ROUTING; VEHICLES;

BENCH-MARK PROBLEMS; GENETIC APPROACH; GENETIC METHODS; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; VEHICLE ROUTING PROBLEMS;

PROBLEM SOLVING;

EID: 84919740953     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2014.11.005     Document Type: Article

References (91)

1. G.B. Dantzig, J.H. Ramser, The truck dispatching problem, Manage. Sci. 4 (1959) 80-91.
2. L. Bodin, B. Golden, A. Assad, M. Ball, Routing and scheduling of vehicles and crews: the state of the art, Comput. Oper. Res. (1983).
3. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1st ed., W. H. Freeman, 1979.
4. M.H. Hà, N. Bostel, A. Langevin, L.-M. Rousseau, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, Comput. Oper. Res. 43 (0) (2014) 9-19.
5. M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, Cambridge, MA, USA, 1998.
6. S. Wang, J. Watada, A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty, Inf. Sci. (Ny). 192 (2012) 3-18.
7. S. Wang, J. Watada, W. Pedrycz, Value-at-risk-based two-stage fuzzy facility location problems, IEEE Trans. Ind. Inform. 5 (2009) 465-482.
8. S. Wang, J. Watada, W. Pedrycz, Recourse-based facility-location problems in hybrid uncertain environment, IEEE Trans. Syst. Man Cybern. Part B: Cybern. 40 (2010) 1176-1187.
9. Y.-J. Gong, J. Zhang, O. Liu, R.-Z. Huang, H.S.-H. Chung, Y.-H. Shi, Optimizing the vehicle routing problem with time windows: a discrete particle swarm optimization approach, IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 42 (2012) 254-267.
10. S.H.R. Pasandideh, S.T.A. Niaki, Genetic application in a facility location problem with random demand within queuing framework, J. Intell. Manuf. 23 (2010) 651-659.
11. J. Qin, L. Ni, F. Shi, Combined simulated annealing algorithm for the discrete facility location problem, Sci. World J. 2012 (2012) 1-7.
12. V.F. Yu, S.-W. Lin, W. Lee, C.-J. Ting, A simulated annealing heuristic for the capacitated location routing problem, Comput. Ind. Eng. 58 (2010) 288-299.
13. M. Sun, A tabu search heuristic procedure for the capacitated facility location problem, J. Heuristics 18 (2011) 91-118.
14. J.-F. Cordeau, M. Maischberger, A parallel iterated tabu search heuristic for vehicle routing problems, Comput. Oper. Res. 39 (2012) 2033-2050.
15. R.Z. Farahani, N. Asgari, N. Heidari, M. Hosseininia, M. Goh, Covering problems in facility location: a review, Comput. Ind. Eng. 62 (2012) 368-407.
16. J. Mihelic, B. Robic, Facility location and covering problems, Theor. Comput. Sci. Inf. Soc. (2004) 4-5.
17. L.V. Snyder, Facility location under uncertainty: a review, IIE Trans. 38 (2006) 547-564.
18. M.A. Arostegui, S.N. Kadipasaoglu, B.M. Khumawala, An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems, Int. J. Prod. Econ. 103 (2006) 742-754.
19. H. Youssef, S.M. Sait, H. Adiche, Evolutionary algorithms, simulated annealing and tabu search: a comparative study, Eng. Appl. Artif. Intell. 14 (2001) 167-181.
20. D.B. Shmoys, J.K. Lenstra, A.H.G.R. Kan, E.L. Lawler, The Traveling Salesman Problem, John Wiley & Sons, 1985.
21. C. Liong, W. Ismail, Vehicle routing problem: models and solutions, J. Qual. Technol. 4 (1) (2008) 205-218.
22. G. Laporte, The vehicle routing problem: an overview of exact and approximate algorithms, Eur. J. Oper. Res. 59 (3) (1992) 345-358.
23. P. Toth, D. Vigo (Eds.), The vehicle routing problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2001.
24. J. Renaud, G. Laporte, F.F. Boctor, A tabu search heuristic for the multi-depot vehicle routing problem, Comput. Oper. Res. 23 (3) (1996) 229-235.
25. B. Ombuki-Berman, F. Hanshar, Using genetic algorithms for multi-depot vehicle routing, in: in Bio-Inspired Algorithms for the Vehicle Routing Problem, vol. 161, 2009, pp. 77-99.
26. C. Darwin, The Origin of Species: By Means of Natural Selection or the Preservation of Favoured Races in the Struggle for Life, reissue ed., Murray, London, 1859.
27. J.H. Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, University of Michigan Press, 1975.
28. K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, PhD dissertation, Ann Arbor, MI, USA, 1975.
29. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1st ed., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1989.
30. D. Whitley, A genetic algorithm tutorial, Stat. Comput. 4 (2) (1994) 65-85.
31. A. Wren, A. Holiday, Computer scheduling of vehicles from one or more depots to a number of delivery points, J. Oper. Res. Soc. 23 (3) (1972) 333-344.
32. R.T. Sumichrast, I.S. Markham, A heuristic and lower bound for a multi-depot routing problem, Comput. Oper. Res. 22 (10) (Dec 1995) 1047-1056.
33. G. Clarke, J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12 (4) (1964) 568-581.
34. M. Gendreau, A. Hertz, G. Laporte, A tabu search heuristic for the vehicle routing problem, Manage. Sci. 40 (10) (1994) 1276-1290.
35. S. Salhi, M. Sari, A multi-level composite heuristic for the multi-depot vehicle fleet mix problem, Eur. J. Oper. Res. 103 (1) (1997) 95-112.
36. R.T. Sumichrast, I.S. Markham, A heuristic and lower bound for a multi-depot routing problem, Comput. Oper. Res. 22 (10) (1995) 1047-1056.
37. B.E. Gillett, L.R. Miller, A heuristic algorithm for the vehicle-dispatch problem, Oper. Res. 22 (2) (1974) 340-349.
38. B.E. Gillett, J.G. Johnson, Multi-terminal vehicle-dispatch algorithm, Omega 4 (6) (1976) 711-718.
39. G. Laporte, Y. Nobert, D. Arpin, Optimal solutions to capacitated multi-depot vehicle routing problems, Congr. Num. 44 (1984) 283-292.
40. S.R. Thangiah, S. Salhi, Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem, Appl. Artif. Intell. 15 (4) (2001) 361-383.
41. H. Min, J. Current, D. Schilling, The multiple depot vehicle routing problem with backhauling, J. Bus. Logist. 13 (1) (1992) 259-288.
42. B. Crevier, J.-F. Cordeau, G. Laporte, The multi-depot vehicle routing problem with inter-depot routes, Eur. J. Oper. Res. 176 (2) (Jan 2007) 756-773.
43. N. Skok, D. Skrlec, S. Krajcar, The genetic algorithm method for multiple depot capacitated vehicle, Knowl. Based Intell. Inf. Eng. Syst. (2000) 520-526.
44. E. Cao, M. Lai, An improved differential evolution algorithm for the vehicle routing problem with simultaneous delivery and pick-up service, in: Third International Conference on Natural Computation, 2007, pp. 436-440.
45. G. Li, Research on open vehicle routing problem with time windows based on improved genetic algorithm, in: 2009 International Conference on Computational Intelligence and Software Engineering, 2009, pp. 1-5.
46. B. Ombuki, B.J. Ross, F. Hanshar, Multi-objective genetic algorithms for vehicle routing problem with time windows, Appl. Intell. 24 (1) (2006) 17-30.
47. K.Q. Zhu, A New Genetic Algorithm For VRPTW, 2000.
48. H.G. Santos, L.S. Ochi, E.H. Marinho, L.M.a. Drummond, Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem, Neurocomputing 70 (1-3) (Dec 2006) 70-77.
49. L. Xing, P. Rohlfshagen, Y. Chen, X. Yao, An evolutionary approach to the multidepot capacitated arc routing problem, IEEE Trans. Evol. Comput. 14 (3) (2010) 356-374.
50. F.B. Pereira, J. Tavares, P. Machado, E. Costa, GVR: A New Genetic Representation for the Vehicle Routing Problem, 2002, pp. 95-102.
51. L.S. Ochi, D.S. Vianna, L.M.a. Drummond, A. Victor, A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet, Futur. Gener. Comput. Syst. 14 (5-6) (1998) 285-292.
52. K. Ganesh, T.T. Narendran, CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up, Eur. J. Oper. Res. 178 (3) (2007) 699-717.
53. I. Kamkar, M. Poostchi, M. AkbarzadehTotonchi, A cellular genetic algorithm for solving the vehicle routing problem with time windows, in: X.-Z. Gao, A. Gaspar-Cunha, M. Köppen, G. Schaefer, J. Wang (Eds.), Soft Computing in Industrial Applications, vol. 75, Springer, Berlin/Heidelberg, 2010, pp. 263- 270.
54. M.M. Haghighi, M. HadiZahedi, M. Ghazizadeh, A multi level priority clustering GA based approach for solving heterogeneous Vehicle Routing Problem (PCGVRP), in: T. Sobh (Ed.), Innovations and Advances in Computer Sciences and Engineering, Springer, The Netherlands, 2010, pp. 331-335.
55. A. Moura, A multi-objective genetic algorithm for the vehicle routing with time windows and loading problem, in: A. Bortfeldt, J. Homberger, H. Kopfer, G. Pankratz, R. Strangmeier (Eds.), Intelligent Decision Support, Gabler, 2008, pp. 187-201.
56. S.F. Ghannadpour, S. Noori, R. Tavakkoli-Moghaddam, K. Ghoseiri, A multiobjective dynamic vehicle routing problem with fuzzy time windows: model, solution and application, Appl. Soft Comput. 14 (Part C) (2014) 504-527.
57. Z. Ursani, D. Essam, D. Cornforth, R. Stocker, Localized genetic algorithm for vehicle routing problem with time windows, Appl. Soft Comput. 11 (8) (2011) 5375-5390.
58. K. Ghoseiri, S.F. Ghannadpour, Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm, Appl. Soft Comput. 10 (4) (2010) 1096-1107.
59. S. Wink, T. Back, M. Emmerich, A meta-genetic algorithm for solving the capacitated vehicle routing problem, in: 2012 IEEE Congress on Evolutionary Computation, 2012, pp. 1-8.
60. F. Zhao, D. Mei, J. Sun, W. Liu, A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery, in: 2009 Chinese Control and Decision Conference, 2009, pp. 3928-3933.
61. I.-C. Choi, S.-I. Kim, H.-S. Kim, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, Comput. Oper. Res. 30 (5) (2003) 773-786.
62. Y.-L. Xu, M.-H. Lim, M.-J. Er, Investigation on genetic representations for vehicle routing problem, in: IEEE International Conference on Systems, Man, and Cybernetics, 2005.
63. S. Salhi, R.J. Petch, A GA based heuristic for the vehicle routing problem with multiple trips, J. Math. Modell. Algorithms 6 (4) (Jul 2007) 591-613.
64. J. Berger, M. Barkaoui, A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, Comput. Oper. Res. 31 (12) (2004) 2037-2053.
65. K.C. Tan, Y.H. Chew, L.H. Lee, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Comput. Optim. Appl. 34 (1) (2005) 115-151.
66. A. Garcia-Najera, J.a. Bullinaria, An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows, Comput. Oper. Res. 38 (1) (Jan 2011) 287-300.
67. Z. Ursani, R. Sarker, H. Abbass, Improving the performance of genetic algorithm in capacitated vehicle routing problem using self imposed constraints, Comput. Intell. Schedul. (2007) 220-225.
68. Y. Zhang, J. Liu, F. Duan, J. Ren, Genetic algorithm in vehicle routing problem, in: Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Nov 2007, pp. 578-581.
69. W. Jie-sheng, L. Chang, Z. Ying, Solving capacitated vehicle routing problem based on improved genetic algorithm, in: 2011 Chinese Control and Decision Conference (CCDC), vol. 1, May 2011, pp. 60-64.
70. G.B. Alvarenga, G.R. Mateus, G. de Tomi, A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows, Comput. Oper. Res. 34 (6) (2007) 1561-1584.
71. K.Q. Zhu, A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows, IEEE Trans. Appl. Ind. (2003) 176-183.
72. M. Filipec, D. Skrlec, S. Krajcar, Darwin meets computers: new approach to multiple depot capacitated vehicle routing problem, in: IEEE International Conference on Systems, Man, and Cybernetics, vol. 1, 1997, pp. 421-426.
73. J.E. Mendoza, B. Castanier, C. Guéret, A.L. Medaglia, N. Velasco, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, Comput. Oper. Res. 37 (11) (2010) 1886-1898.
74. B. Baker, A genetic algorithm for the vehicle routing problem, Comput. Oper. Res. 30 (2003) 787-800.
75. C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Comput. Oper. Res. 31 (12) (2004) 1985-2002.
76. L.M.a. Drummond, L.S. Ochi, D.S. Vianna, An asynchronous parallel metaheuristic for the period vehicle routing problem, Futur. Gener. Comput. Syst. 17 (4) (2001) 379-386.
77. A.E. Eiben, J.E. Smith, Introduction to Evolutionary Computing, 2003.
78. N. Jozefowiez, F. Semet, E.-G. Talbi, An evolutionary algorithm for the vehicle routing problem with route balancing, Eur. J. Oper. Res. 195 (3) (Jun 2009) 761-769.
79. L.D. Whitley, T. Starkweather, D. Fuquay, Scheduling problems and traveling salesmen: the genetic edge recombination operator, in: International Conference on Genetic Algorithms, 1989, pp. 133-140.
80. Y. Nagata, Edge Assembly Crossover for the Capacitated Vehicle Routing Problem, 2007, pp. 142-153.
81. Y. Zhang, S. Chen, J. Liu, F. Duan, The application of genetic algorithm in vehicle routing problem, in: 2008 International Symposium on Electronic Commerce and Security, vol. 3, 2008, pp. 3-6.
82. E. Taniguchi, H. Shimamoto, Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times, Transport. Res. Part C: Emerg. Technol. 12 (3-4) (2004) 235-250.
83. Y. Li, Y. Liu, Research on Vehicle Routing Problem Based on Immune Genetic Algorithm, in: 2010 2nd International Conference on Information Engineering and Computer Science, vol. 5, 2010, pp. 1-4.
84. J. Demšar, Statistical comparison of classi.ers over multiple data sets, J. Mach. Learn. Res. 7 (2006) 1-30.
85. C. Contardo, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, Université du Québec à Montréal, Montréal, Québec, Canada, 2012, UQÀM-Archipel5078.
86. J.-F. Cordeau, M. Maischberger, A parallel iterated tabu search heuristic for vehicle routing problems, Comput. Oper. Res. 39 (9) (2012) 2033-2050.
87. M. Dorigo, V. Maniezzo, A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Trans. Syst. Man Cybern. 26 (1) (1996) 29-41.
88. B. Yu, Z. Yang, B. Yao, An improved ant colony optimization for vehicle routing problem, Eur. J. Oper. Res. 196 (1) (2009) 171-176.
89. B. Yu, Z.Z. Yang, J.-X. Xie, A parallel improved ant colony optimization for multidepot vehicle routing problem, J. Oper. Res. Soc. 62 (1) (2011) 183-188.
90. D. Pisinger, S. Ropke, A general heuristic for vehicle routing problems, Comput. Oper. Res. 34 (8) (2007) 2403-2435.
91. P. Surekha, Solution to multi-depot vehicle routing problem using genetic algorithms, World (2011) 118-131.