Advertisement

New Heuristics for the Vehicle Routing Problem

  • Jean-François Cordeau
  • Michel Gendreau
  • Alain Hertz
  • Gilbert Laporte
  • Jean-Sylvain Sormany
Chapter

Abstract

This chapter reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on population search and on learning mechanisms. Comparative computational results are provided on a set of 34 benchmark instances.

Keywords

Local Search Tabu Search Travel Salesman Problem Travel Salesman Problem Memetic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldacci, R., Hadjiconstantinou, E.A. and Mingozzi, A. (2004). An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research, 52(5):723–738.CrossRefMathSciNetGoogle Scholar
  2. Barbarosoğlu, G. and Ögüir, D. (1999). A tabu search algorithm for the vehicle routing problem. Computers & Operations Research, 26:255–270.CrossRefMathSciNetGoogle Scholar
  3. Bean, J.C. (1994). Genetic algorithms and random keys for the sequencing and optimization. ORSA Journal on Computing, 6:154–160.zbMATHGoogle Scholar
  4. Beasley, J.E. (1983). Route-first cluster-second methods for vehicle routing. Omega, 11:403–408.CrossRefGoogle Scholar
  5. Berger, J. and Barkaoui, M. (2004). A new hybrid genetic algorithm for the capacitated vehicle routing problem. Journal of the Operational Research Society, 54:1254–1262.CrossRefGoogle Scholar
  6. Christofides, N., Mingozzi, A., and Toth, P. (1979). The vehicle routing problem. In: N. Christofides, A. Mingozzi, and P. Toth (eds.), Combinatorial Optimization, pp. 315–338. Wiley, Chichester.Google Scholar
  7. Clarke, G. and Wright, J.W. (1964) Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568–581.CrossRefGoogle Scholar
  8. Codenetti, B., Manzini, G., Margara, L., and Resta, G. (1996). Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP. INFORMS Journal on Computing, 8:125–133.CrossRefGoogle Scholar
  9. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F. (2002a). VRP with time windows. In: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, pp. 157–193. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.Google Scholar
  10. Cordeau, J.-F., Gendreau, M., and Laporte, G. (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30:105–119.CrossRefGoogle Scholar
  11. Cordeau, J.-F., Gendreau M., Laporte, G., Potvin, J.-Y., and Semet, F. (2002b). A guide to vehicle routing heuristics. Journal of the Operational Research Society, 53:512–522.CrossRefGoogle Scholar
  12. Cordeau, J.-F. and Laporte, G. (2004). Tabu search heuristics for the vehicle routing problem. In: C. Rego and B. Alidaee (eds.), Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pp. 145–163. Kluwer, Boston.Google Scholar
  13. Cordeau, J.-F., Laporte, G., and Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52:928–936.CrossRefGoogle Scholar
  14. Cordeau, J.-F., Laporte, G., and Mercier, A. (2004). An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. Journal of the Operational Research Society, 55:542–546.CrossRefGoogle Scholar
  15. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., and Soumis, F. (2002). VRP with pickup and delivery. In: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, pages 225–242. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.Google Scholar
  16. Dongarra, J.J. (2004). Performance of various computers using standard linear equations software. Technical Report CS-89-85. Computer Science Department, University of Tennessee.Google Scholar
  17. Drezner, Z. (2003). A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing, 15:320–330.CrossRefMathSciNetGoogle Scholar
  18. Dueck, G. (1993). New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics, 104:86–92.CrossRefADSzbMATHGoogle Scholar
  19. Ergun, Ö., Orlin, J.B., and Steele-Feldman, A. (2003). Creating Very Large Scale Neighborhoods Out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem. Working paper, Massachusetts Institute of Technology.Google Scholar
  20. Fahrion, R. and Wrede, M. (1990). On a principle of chain-exchange for vehicle-routeing problems (1-VRP). Journal of the Operational Research Society, 41:821–827.Google Scholar
  21. Fisher, M.L., and Jaikumar, R. (1981). A generalized assignment heuristic for the vehicle routing problem. Networks, 11:109–124.MathSciNetCrossRefGoogle Scholar
  22. Gendreau, M., Hertz, A., and Laporte, G. (1992). New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40:1086–1094.MathSciNetCrossRefGoogle Scholar
  23. Gendreau, M., Hertz, A., and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40:1276–1290.CrossRefGoogle Scholar
  24. Gendreau, M., Laporte, G., and Potvin, J.-Y. (2002). Metaheuristics for the VRP. In: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, pages 129–154. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.Google Scholar
  25. Ghaziri, H. (1991). Solving routing problems by a self-organizing map. In: T. Kohonen, K. Makisara, O. Simula, and J. Kangas (eds.), Artificial Neural Networks, pp. 829–834. North-Holland, Amsterdam.Google Scholar
  26. Ghaziri, H. (1996). Supervision in the self-organizing feature map: Application to the vehicle routing problem. In: I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory and Applications, pp. 651–660. Kluwer, Boston.Google Scholar
  27. Gillett, B.E. and Miller, L.R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22:340–349.CrossRefGoogle Scholar
  28. Golden, B.L., Wasil, E.A., Kelly, J.P., and Chao, I-M. (1998). Metaheuristics in vehicle routing. In: T.G. Crainic and G. Laporte (eds.), Fleet Management and Logistics, pp. 33–56. Kluwer, Boston.Google Scholar
  29. Kinderwater, G.A.P. and Savelsbergh, M.W.P. (1997). Vehicle routing: Handling edge exchanges. In: E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization, pages 337–360. Wiley, Chichester.Google Scholar
  30. Laporte, G. and Semet, F. (2002). Classical heuristics for the capacitated VRP. In: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, pp. 109–128. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.Google Scholar
  31. Li, F., Golden, B.L., and Wasil, E.A. (2005). Very large-scale vehicle routing: New test problems, algorithms, and results. Computers & Operations Research, 32:1165–1179.Google Scholar
  32. Lin, S. (1965). Computer solution of the traveling salesman problem. Bell System Technical Journal, 44:2245–2269.zbMATHMathSciNetGoogle Scholar
  33. Liu, F.-H., and Shen, S.-Y. (1999). A route-neighbourhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research, 118:485–504.CrossRefGoogle Scholar
  34. Matsuyama, Y. (1991). Self-organization via competition, cooperation and categorization applied to extended vehicle routing problems. In: Proceedings of the International Joint Conference on Neural Networks, pp. 385–390. Seatle, WA.Google Scholar
  35. Mester, D. (2004). Private communication.Google Scholar
  36. Mester, D. and Bräysy, O. (2004). Active guided evolution strategies for the large scale vehicle routing problems with time windows. Computers & Operations Research, 32:1593–1614.CrossRefGoogle Scholar
  37. Mladenović, N. and Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24:1097–1100.CrossRefMathSciNetGoogle Scholar
  38. Moscato, P. and Cotta, C. (2003). A gentle introduction to memetic algorithms. In: F. Glover and G.A. Kochenberger (eds.), Handbook of Metaheuristics, pp. 105–144. Kluwer, Boston.Google Scholar
  39. Naddef, D. and Rinaldi, G. (2002). Branch-and-cut algorithms for the capacitated VRP. In: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, pp. 53–84. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.Google Scholar
  40. Or, I. (1976). Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph.D. Thesis, Northwestern University, Evanston, IL.Google Scholar
  41. Osman, I.H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421–451.CrossRefzbMATHGoogle Scholar
  42. Paessens, H. (1988). The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34:336–344.CrossRefzbMATHGoogle Scholar
  43. Potvin, J.-Y. (1996). Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 63:339–370.CrossRefzbMATHGoogle Scholar
  44. Potvin, J.-Y. and Rousseau, J.-M. (1995). An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society, 46:1433–3446.Google Scholar
  45. Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31:1985–2002.CrossRefzbMATHMathSciNetGoogle Scholar
  46. Rechenberg, I. (1973). Evolutionsstrategie. Fromman-Holzboog, Stuttgart.Google Scholar
  47. Reeves, F. (2003). Genetic algorithms. In: F. Glover and G.A. Kochenberger (eds.), Handbook of Metaheuristics, pp. 55–82. Kluwer, Boston.Google Scholar
  48. Rego, C. (1998). A subpath ejection method for the vehicle routing problem. Management Science, 44:1447–1459.zbMATHCrossRefGoogle Scholar
  49. Rego, C. and Roucairol, C. (1996). A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Meta-Heuristics: Theory and Applications, pp. 661–675, Kluwer, Boston.Google Scholar
  50. Reimann, M., Doerner, K., and Hartl, R.F. (2004). D-Ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research, 31:563–591.CrossRefGoogle Scholar
  51. Renaud, J., Boctor, F.F., and Laporte, G. (1996). A fast composite heuristic for the symmetric traveling salesman problem. INFORMS Journal on Computing, 8:134–143.CrossRefGoogle Scholar
  52. Rochat, Y. and Taillard, É.D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1:147–167.CrossRefGoogle Scholar
  53. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In: M. Maher and J.-F. Puget (eds.), Principles and Practice of Constraint Programming, pp. 417–431. Lecture Notes in Computer Science, Springer-Verlag, New York.Google Scholar
  54. Schumann, M. and Retzko, R. (1995). Self-organizing maps for vehicle routing problems—minimizing an explicit cost function. In: F. Fogelman-Soulie (ed.), Proceedings of the International Conference on Artificial Neural Networks, pp. 401–406. Paris.Google Scholar
  55. Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time windows. Operations Research, 35:254–265.zbMATHMathSciNetCrossRefGoogle Scholar
  56. Taillard, É.D. (1993). Parallel iterative search methods for vehicle routing problem. Networks, 23:661–673.zbMATHCrossRefGoogle Scholar
  57. Tarantilis, C.-D. and Kiranoudis, C.T. (2002). Bone Route: An adaptive memory-based method for effective fleet management. Annals of Operations Research, 115:227–241.CrossRefMathSciNetGoogle Scholar
  58. Thompson, P.M. and Psaraftis, H.N. (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research, 41:935–946.MathSciNetCrossRefGoogle Scholar
  59. Toth, P. and Vigo, D. (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15:333–346.CrossRefMathSciNetGoogle Scholar
  60. van Breedam, A. (1994). An Analysis of the Behavior of Heuristics for the Vehicle Routing Problem for a Selection of Problems with Vehicle-Related, Customer-Related, and Time-Related Constraints. Ph.D. Dissertation, University of Antwerp.Google Scholar
  61. Voudouris, C. (1997). Guided Local Search for Combinatorial Problems. Dissertation, University of Essex.Google Scholar
  62. Xu, J. and Kelly, J.P. (1996). A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science, 30:379–393.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Jean-François Cordeau
  • Michel Gendreau
  • Alain Hertz
  • Gilbert Laporte
  • Jean-Sylvain Sormany

There are no affiliations available

Personalised recommendations

Cite chapter

Buy options