Skip to main content
SpringerLink
Log in

New Heuristics for the Vehicle Routing Problem

  • Chapter
Logistics Systems: Design and Optimization

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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.

    Article  MathSciNet  Google Scholar 

  • Barbarosoğlu, G. and Ögüir, D. (1999). A tabu search algorithm for the vehicle routing problem. Computers & Operations Research, 26:255–270.

    Article  MathSciNet  Google Scholar 

  • Bean, J.C. (1994). Genetic algorithms and random keys for the sequencing and optimization. ORSA Journal on Computing, 6:154–160.

    MATH  Google Scholar 

  • Beasley, J.E. (1983). Route-first cluster-second methods for vehicle routing. Omega, 11:403–408.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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 

  • Drezner, Z. (2003). A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing, 15:320–330.

    Article  MathSciNet  Google Scholar 

  • Dueck, G. (1993). New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics, 104:86–92.

    Article  ADS  MATH  Google Scholar 

  • 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 

  • 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 

  • Fisher, M.L., and Jaikumar, R. (1981). A generalized assignment heuristic for the vehicle routing problem. Networks, 11:109–124.

    Article  MathSciNet  Google Scholar 

  • Gendreau, M., Hertz, A., and Laporte, G. (1992). New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40:1086–1094.

    Article  MathSciNet  Google Scholar 

  • Gendreau, M., Hertz, A., and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40:1276–1290.

    Article  Google Scholar 

  • 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 

  • 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 

  • 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 

  • Gillett, B.E. and Miller, L.R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22:340–349.

    Article  Google Scholar 

  • 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 

  • 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 

  • 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 

  • 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 

  • Lin, S. (1965). Computer solution of the traveling salesman problem. Bell System Technical Journal, 44:2245–2269.

    MATH  MathSciNet  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • Mester, D. (2004). Private communication.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Mladenović, N. and Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24:1097–1100.

    Article  MathSciNet  Google Scholar 

  • 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 

  • 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 

  • 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 

  • Osman, I.H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421–451.

    Article  MATH  Google Scholar 

  • Paessens, H. (1988). The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34:336–344.

    Article  MATH  Google Scholar 

  • Potvin, J.-Y. (1996). Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 63:339–370.

    Article  MATH  Google Scholar 

  • 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 

  • Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31:1985–2002.

    Article  MATH  MathSciNet  Google Scholar 

  • Rechenberg, I. (1973). Evolutionsstrategie. Fromman-Holzboog, Stuttgart.

    Google Scholar 

  • Reeves, F. (2003). Genetic algorithms. In: F. Glover and G.A. Kochenberger (eds.), Handbook of Metaheuristics, pp. 55–82. Kluwer, Boston.

    Google Scholar 

  • Rego, C. (1998). A subpath ejection method for the vehicle routing problem. Management Science, 44:1447–1459.

    Article  MATH  Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Rochat, Y. and Taillard, É.D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1:147–167.

    Article  Google Scholar 

  • 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 

  • 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 

  • Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time windows. Operations Research, 35:254–265.

    Article  MATH  MathSciNet  Google Scholar 

  • Taillard, É.D. (1993). Parallel iterative search methods for vehicle routing problem. Networks, 23:661–673.

    Article  MATH  Google Scholar 

  • 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.

    Article  MathSciNet  Google Scholar 

  • Thompson, P.M. and Psaraftis, H.N. (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research, 41:935–946.

    Article  MathSciNet  Google Scholar 

  • 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.

    Article  MathSciNet  Google Scholar 

  • 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 

  • Voudouris, C. (1997). Guided Local Search for Combinatorial Problems. Dissertation, University of Essex.

    Google Scholar 

  • Xu, J. and Kelly, J.P. (1996). A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science, 30:379–393.

    Article  Google Scholar 

Download references

Authors
  1. Jean-François Cordeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Gendreau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alain Hertz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gilbert Laporte
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jean-Sylvain Sormany
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. GERAD & École Polytechnique de Montréal, Montréal, Canada

    André Langevin  & Diane Riopel  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Cordeau, JF., Gendreau, M., Hertz, A., Laporte, G., Sormany, JS. (2005). New Heuristics for the Vehicle Routing Problem. In: Langevin, A., Riopel, D. (eds) Logistics Systems: Design and Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-24977-X_9

Download citation

Publish with us

Policies and ethics

Search

Navigation