A hybrid particle swarm optimization algorithm for the vehicle routing problem

Engineering Applications of Artificial Intelligence

Volumn 23, Issue 4, 2010, Pages 463-472

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a   Dounias, Georgios ^b  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

Expanding neighborhood search; Metaheuristics; Nature inspired intelligence; Particle swarm optimization; Vehicle routing problem

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL TIME; EFFECTIVE ALGORITHMS; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; HYBRID PARTICLE SWARM OPTIMIZATION; HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM; META HEURISTICS; NEIGHBORHOOD SEARCH; PARTICLE SWARM OPTIMIZATION ALGORITHM; PATH RELINKING; VEHICLE ROUTING PROBLEMS;

COMBINATORIAL OPTIMIZATION; ROUTING ALGORITHMS; SUPPLY CHAIN MANAGEMENT; SUPPLY CHAINS; VEHICLES;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 77950517300     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2010.02.002     Document Type: Article

References (64)

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. Banks A., Vincent J., and Anyakoha C. A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing 7 (2008) 109-124
5. Barbarosoglu G., and Ozgur D. A tabu search algorithm for the vehicle routing problem. Computers and Operations Research 26 (1999) 255-270
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, Chicago, pp. 646-656.
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, New York, USA 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, Heidelber
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. A Bradford Book (2004), 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. Vehicle routing. 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, Philadelphia, USA 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. Golden B.L., and Assad A.A. Vehicle Routing: Methods and Studies (1988), North-Holland, Amsterdam
30. Hansen P., and Mladenovic N. Variable neighborhood search: principles and applications. European Journal of Operational Research 130 (2001) 449-467
31. Kennedy J., and Eberhart R. Particle swarm optimization. Proceedings of 1995 IEEE International Conference on Neural Networks 4 (1995) 1942-1948
32. Kennedy J., and Eberhart R. A discrete binary version of the particle swarm algorithm. Proceedings of 1997 IEEE International Conference on Systems, Man, and Cybernetics 5 (1997) 4104-4108
33. Kennedy J., Eberhart R., and Shi Y. Swarm Intelligence (2001), Morgan Kaufmann Publisher, San Francisco
34. 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, Philadelphia, USA 109-128
35. 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
36. Lichtblau, D., 2002. Discrete optimization using mathematica. In: Callaos, N., Ebisuzaki, T., Starr, B., Abe, J.M., Lichtblau, D. (Eds.), World Multi Conference on Systemics, Cybernetics and Informatics (SCI 2002), vol. 16, International Institute of Informatics and Systemics, pp. 169-174.
37. Lin S. Computer solutions of the traveling salesman problem. Bell Systems Technical Journal 44 (1965) 2245-2269
38. 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, Singapore 205-236
39. Marinakis Y., Migdalas A., and Pardalos P.M. Expanding neighborhood GRASP for the traveling salesman problem. Computational Optimization and Applications 32 (2005) 231-257
40. Marinakis Y., Migdalas A., and Pardalos P.M. A hybrid genetic-GRASP algorithm using Lagrangian relaxation for the traveling salesman problem. Journal of Combinatorial Optimization 10 (2005) 311-326
41. 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
42. Marinakis Y., Migdalas A., and Pardalos P.M. Multiple phase neighborhood search GRASP based on Lagrangian relaxation and random backtracking Lin Kernighan for the traveling salesman problem. Journal of Combinatorial Optimization 17 (2009) 134-156
43. Mester D., and Braysy O. Active guided evolution strategies for the large scale vehicle routing problems. Computers and Operations Research 34 10 (2007) 2964-2975
44. Mole R.H., and Jameson S.R. A sequential route-building algorithm employing a generalized savings criterion. Operational Research Quarterly 27 (1976) 503-511
45. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Annals of Operations Research 41 (1993) 421-451
46. Poli R., Kennedy J., and Blackwell T. Particle swarm optimization. An overview. Swarm Intelligence 1 (2007) 33-57
47. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31 (2004) 1985-2002
48. Rego C. A subpath ejection method for the vehicle routing problem. Management Science 44 (1998) 1447-1459
49. Rego C. Node-ejection chains for the vehicle routing problem sequential and parallel algorithms. Parallel Computing 27 3 (2001) 201-222
50. 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, New York, pp. 1317-1326.
51. 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
52. Rennard J.F. Handbook of Research on Nature Inspired Computing for Economics and Management (2006), Idea Group Reference, Hershey, PA, USA
53. 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
54. Rochat Y., and Taillard E.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
55. Shi, Y., Eberhart, R., 1998. A modified particle swarm optimizer. In: Proceedings of 1998 IEEE world Congress on Computational Intelligence, pp. 69-73.
56. Taillard E.D. Parallel iterative search methods for vehicle routing problems. Networks 23 (1993) 661-672
57. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 32 9 (2005) 2309-2327
58. 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
59. 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
60. 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
61. Toth P., and Vigo D. The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications (2002), SIAM, Philadelphia, USA
62. 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
63. Wark P., and Holt J. A repeated matching heuristic for the vehicle routing problem. Journal of the Operational Research Society 45 (1994) 1156-1167
64. 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