A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem

Expert Systems with Applications

Volumn 37, Issue 2, 2010, Pages 1446-1455

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Genetic algorithms; Particle Swarm Optimization; Vehicle routing problem

Indexed keywords

BASIC PRINCIPLES; COMBINATORIAL OPTIMIZATION PROBLEMS; GENETIC LOCAL SEARCH; MEMETIC ALGORITHMS; NEW SOLUTIONS; PARTICLE SWARM OPTIMIZATION ALGORITHM; PARTICLE SWARM OPTIMIZERS; PHYSICAL MOVEMENTS; SOLUTION SPACE; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO); VEHICLES;

ROUTING ALGORITHMS;

EID: 71749086093     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.06.085     Document Type: Article

References (75)

1. Altinkemer K., and Gavish B. Parallel savings based heuristics for the delivery problem. Operations Research 39 3 (1991) 456-469
2. Baker B.M., and Ayechew M.A. A genetic algorithm for the vehicle routing problem. Computers and Operations Research 30 5 (2003) 787-800
3. Banks A., Vincent J., and Anyakoha C. A review of particle swarm optimization. Part I: Background and development. Natural Computing 6 4 (2007) 467-484
4. Barbarosoglu G., and Ozgur D. A tabu search algorithm for the vehicle routing problem. Computers and Operations Research 26 (1999) 255-270
5. Baykasoglu A., Ozbakor L., and Tapkan P. Artificial bee colony algorithm and its application to generalized assignment problem. In: Chan F.T.S., and Tiwari M.K. (Eds). Swarm intelligence, focus on ant and particle swarm optimization (2007), I-Tech Education and Publishing 113-144
6. Berger, J., & Barkaoui, M. (2003). A hybrid genetic algorithm for the capacitated vehicle routing problem. In Proceedings of the genetic and evolutionary computation conference (pp. 646-656). Chicago.
7. Bodin L., and Golden B. Classification in vehicle routing and scheduling. Networks 11 (1981) 97-108
8. Bodin L., Golden B., Assad A., and Ball M. The state of the art in the routing and scheduling of vehicles and crews. Computers and Operations Research 10 (1983) 63-212
9. Bullnheimer B., Hartl P.F., and Strauss C. An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319-328
10. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem. In: Christofides N., Mingozzi A., Toth P., and Sandi C. (Eds). Combinatorial optimization (1979), Wiley, Chichester
11. Clarke G., and Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
12. Cordeau J.F., Gendreau M., Laporte G., Potvin J.Y., and Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53 (2002) 512-522
13. Cordeau J.F., Gendreau M., Hertz A., Laporte G., and Sormany J.S. New heuristics for the vehicle routing problem. In: Langevine A., and Riopel D. (Eds). Logistics systems: Design and optimization (2005), Wiley and Sons 279-298
14. Dantzig G.B., and Ramser J.H. The truck dispatching problem. Management Science 6 1 (1959) 80-91
15. In: Dasgupta D. (Ed). Artificial immune systems and their application (1998), Springer, Heidelberg
16. De Castro L.D., and Timmis J. Artificial immune systems: A new computational intelligence approach (2002), Springer, Heidelberg
17. Desrochers, M., & Verhoog, T. W. (1989). A matching based savings algorithm for the vehicle routing problem. Les Cahiers du GERAD G-89-04. Ecole des Hautes Etudes Commerciales de Montreal.
18. Dorigo M., and Stutzle T. Ant colony optimization (2004), A Bradford Book, The MIT Press Cambridge, Massachusetts, London, England
19. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedure. Journal of Global Optimization 6 (1995) 109-133
20. Fisher M.L. In: Ball M.O., Magnanti T.L., Momma C.L., and Nemhauser G.L. (Eds). Network routing. Handbooks in operations research and management science Vol. 8 (1995), North Holland, Amsterdam 1-33
21. Fisher M.L., and Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks 11 (1981) 109-124
22. Foster B.A., and Ryan D.M. An integer programming approach to the vehicle scheduling problem. Operations Research 27 (1976) 367-384
23. Garfinkel R., and Nemhauser G. Integer programming (1972), John Wiley and Sons, New York
24. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
25. Gendreau M., Laporte G., and Potvin J.Y. Vehicle routing: Modern heuristics. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1997), Wiley, Chichester 311-336
26. Gendreau M., Laporte G., and Potvin J.Y. Metaheuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem. Monographs on discrete mathematics and applications (2002), Siam 129-154
27. Gillett B.E., and Miller L.R. A heuristic algorithm for the vehicle dispatch problem. Operations Research 22 (1974) 240-349
28. Glover F., Laguna M., and Marti R. Scatter search and path relinking: Advances and applications. In: Glover F., and Kochenberger G.A. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Boston 1-36
29. Goldberg D.E. Genetic algorithms in search, optimization, and machine learning (1989), Addison-Wesley Publishing Company, INC, Massachussets
30. Golden B.L., and Assad A.A. Vehicle routing: Methods and studies (1988), North Holland, Amsterdam
31. Golden B.L., Wasil E.A., Kelly J.P., and Chao I.M. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. In: Crainic T.G., and Laporte G. (Eds). Fleet management and logistics (1998), Kluwer Academic Publishers, Boston 33-56
32. Golden B., Raghavan S., and Wasil E. The vehicle routing problem: Latest advances and new challenges (2008), Springer LLC
33. Hansen P., and Mladenovic N. Variable neighborhood search: Principles and applications. European Journal of Operational Research 130 (2001) 449-467
34. Holland J.H. Adaptation in natural and artificial systems (1975), University of Michigan Press, Ann Arbor, MI
35. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of 1995 IEEE international conference on neural networks (Vol. 4, pp. 1942-1948).
36. Kennedy, J., & Eberhart, R. (1997). A discrete binary version of the particle swarm algorithm. In Proceedings of 1997 IEEE international conference on systems, man, and cybernetics (Vol. 5, pp. 4104-4108).
37. Kennedy J., Eberhart R., and Shi Y. Swarm intelligence (2001), Morgan Kaufmann Publisher, San Francisco
38. Laporte G., Gendreau M., Potvin J.Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7 (2000) 285-300
39. Laporte G., and Semet F. Classical heuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem, monographs on discrete mathematics and applications (2002), Siam 109-128
40. Li F., Golden B., and Wasil E. Very large-scale vehicle routing: New test problems, algorithms and results. Computers and Operations Research 32 5 (2005) 1165-1179
41. Lin S. Computer solutions of the traveling salesman problem. Bell Systems Technical Journal 44 (1965) 2245-2269
42. Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operation Research 21 (1973) 498-516
43. Marinakis Y., and Migdalas A. Heuristic solutions of vehicle routing problems in supply chain management. In: Pardalos P.M., Migdalas A., and Burkard R. (Eds). Combinatorial and global optimization (2002), World Scientific Publishing Co. 205-236
44. Marinakis Y., Migdalas A., and Pardalos P.M. Expanding neighborhood GRASP for the traveling salesman problem. Computational Optimization and Applications 32 (2005) 231-257
45. Marinakis Y., Migdalas A., and Pardalos P.M. A hybrid genetic-GRASP algorithm using Langrangean relaxation for the traveling salesman problem. Journal of Combinatorial Optimization 10 (2005) 311-326
46. Marinakis, Y., Migdalas, A., & Pardalos, P. M. (2007a). Multiple phase neighborhood search GRASP based on Lagrangean relaxation and random backtracking Lin Kernighan for the traveling salesman problem. Journal of Combinatorial Optimization. (Available on line doi: 10.1007/s10878-007-9104-2).
47. Marinakis Y., Migdalas A., and Pardalos P.M. A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. Journal of Global Optimization 38 (2007) 555-580
48. Marinakis Y., Marinaki M., and Dounias G. Honey bees mating optimization algorithm for the vehicle routing problem. In: Krasnogor N., Nicosia G., Pavone M., and Pelta D. (Eds). Nature inspired cooperative strategies for optimization - NICSO 2007. Studies in computational intelligence Vol. 129 (2008), Springer-Verlag, Berlin 139-148
49. Mester D., and Braysy O. Active guided evolution strategies for the large scale vehicle routing problems with time windows. Computers and Operations Research 32 (2005) 1593-1614
50. Mester D., and Braysy O. Active guided evolution strategies for large scale capacitated vehicle routing problems. Computers and Operations Research 34 (2007) 2964-2975
51. Mole R.H., and Jameson S.R. A sequential route-building algorithm employing a generalized savings criterion. Operational Research Quarterly 27 (1976) 503-511
52. Moscato P., and Cotta C. A gentle introduction to memetic algorithms. In: Glover F., and Kochenberger G.A. (Eds). Handbooks of metaheuristics (2003), Kluwer Academic Publishers, Dordrecht 105-144
53. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Annals of Operations Research 41 (1993) 421-451
54. Pereira F.B., and Tavares J. Bio-inspired algorithms for the vehicle routing problem. Studies in computational intelligence Vol. 161 (2008), Springer, Berlin, Heideberg
55. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Computers and Operations Research 34 (2007) 2403-2435
56. Poli R., Kennedy J., and Blackwell T. Particle swarm optimization. An overview. Swarm Intelligence 1 (2007) 33-57
57. Potvin J.Y. Genetic algorithms for the traveling salesman problem. Annals of Operations Research 63 (1996) 339-370
58. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31 (2004) 1985-2002
59. Prins C. A GRASP × evolutionary local search hybrid for the vehicle routing problem. In: Pereira F.B., and Tavares J. (Eds). Bio-inspired algorithms for the vehicle routing problem, SCI 161 (2008), Springer, Berlin, Heideberg 35-53
60. Reimann, M., Stummer, M., & Doerner, K. (2002). A savings based ant system for the vehicle routing problem. In Proceedings of the genetic and evolutionary computation conference (pp. 1317-1326). New York.
61. Reimann M., Doerner K., and Hartl R.F. D-Ants: Savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research 31 4 (2004) 563-591
62. Rego C. A subpath ejection method for the vehicle routing problem. Management Science 44 (1998) 1447-1459
63. Rego C. Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Computing 27 3 (2001) 201-222
64. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G.A. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Boston 219-249
65. Rochat Y., and Taillard E.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
66. Shi, Y., & Eberhart, R. (1998). A modified particle swarm optimizer. In Proceedings of 1998 IEEE world congress on computational intelligence (pp. 69-73).
67. Taillard E.D. Parallel iterative search methods for vehicle routing problems. Networks 23 (1993) 661-672
68. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 32 9 (2005) 2309-2327
69. Tarantilis C.D., Kiranoudis C.T., and Vassiliadis V.S. A backtracking adaptive threshold accepting metaheuristic method for the Vehicle Routing Problem. System Analysis Modeling Simulation (SAMS) 42 5 (2002) 631-644
70. Tarantilis C.D., Kiranoudis C.T., and Vassiliadis V.S. A list based threshold accepting algorithm for the capacitated vehicle routing problem. International Journal of Computer Mathematics 79 5 (2002) 537-553
71. Tarantilis C.D., and Kiranoudis C.T. BoneRoute: An adaptive memory-based method for effective fleet management. Annals of Operations Research 115 1 (2002) 227-241
72. Toth P., and Vigo D. The vehicle routing problem. Monographs on discrete mathematics and applications (2002), Siam
73. Toth P., and Vigo D. The granular tabu search (and its application to the vehicle routing problem). INFORMS Journal on Computing 15 4 (2003) 333-348
74. Wark P., and Holt J. A repeated matching heuristic for the vehicle routing problem. Journal of the Operational Research Society 45 (1994) 1156-1167
75. Xu J., and Kelly J.P. A new network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science 30 (1996) 379-393