Skip to main content
SpringerLink
Log in

Tabu Search Heuristics for the Vehicle Routing Problem

  • Chapter
Metaheuristic Optimization via Memory and Evolution

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 30))

Abstract

This article reviews some of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.

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 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

  • Barker, E.K. (2002) “Evolution of Microcomputer-Based Vehicle Routing Software: Case Studies in United States,” in The Vehicle Routing Problem, P. Toth and D. Vigo (eds), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 353–362.

    Google Scholar 

  • Bozkaya, B., E. Erkut and G. Laporte (2003) “A Tabu Search Heuristic and Adaptive Memory Procedure for Political Districting,” European Journal of Operational Research, 144:12–26.

    Article  MATH  Google Scholar 

  • Christofides, N., A. Mingozzi and P. Toth (1979) “The Vehicle Routing Problem,” in Combinatorial Optimization, N. Christofides, A. Mingozzi and P. Toth (eds), Wiley, Chichester, 315–338.

    Google Scholar 

  • Clarke, G. and J.W. Wright (1964) “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Operations Research, 12:568–581.

    Google Scholar 

  • Cordeau, J.-F., M. Gendreau and G. Laporte (1997) “A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems,” Networks, 30:105–119.

    Article  MATH  Google Scholar 

  • Cordeau, J.-F., M. Gendreau, G. Laporte, J.-Y. Potvin and F. Semet (2002) “A Guide to Vehicle Routing Heuristics,” Journal of the Operational Research Society, 53:512–522.

    Article  MATH  Google Scholar 

  • Cordeau, J.-F. and G. Laporte (2001) “A Tabu Search Algorithm for the Site Dependent Vehicle Routing Problem with Time Windows,” INFOR, 39:292–298.

    Google Scholar 

  • Cordeau, J.-F., G. Laporte and A. Mercier (2001) “A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows,” Journal of the Operational Research Society, 52:928–936.

    Article  MATH  Google Scholar 

  • Croes, G.A. (1958) “A Method for Solving Traveling-Salesman Problems,” Operations Research, 6:791–812.

    MathSciNet  Google Scholar 

  • Dantzig, G.B. and J.H. Ramser (1959) “The Truck Dispatching Problem,” Management Science, 6:80–91.

    MathSciNet  MATH  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 

  • Fahrion, R. and M. Wrede (1990) “On a Principle of Chain-Exchange for Vehicle-Routeing Problems (1-VRP),” Journal of the Operational Research Society, 41:821–827.

    MATH  Google Scholar 

  • Fisher, M.L. and R. Jaikumar (1981) “A Generalized Assignment Heuristic for the Vehicle Routing Problem,” Networks, 11:109–124.

    MathSciNet  Google Scholar 

  • Gendreau, M. (2003) “An Introduction to Tabu Search,” in Handbook of Meta-heuristics, F. Glover and G.A. Kochenberger (eds), Kluwer, Boston, 37–54.

    Google Scholar 

  • Gendreau, M., A. Hertz and G. Laporte (1992) “New Insertion and Postoptimization Procedures for the Traveling Salesman Problem,” Operations Research, 40:1086–1094.

    MathSciNet  MATH  Google Scholar 

  • Gendreau, M., A. Hertz and G. Laporte (1994) “A Tabu Search Heuristic for the Vehicle Routing Problem,” Management Science, 40:1276–1290.

    MATH  Google Scholar 

  • Gendreau, M., G. Laporte and J.-Y. Potvin (2002) “Metaheuristics for the VRP,” in The Vehicle Routing Problem, P. Toth and D. Vigo (eds), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 129–154.

    Google Scholar 

  • Gillett, B.E. and L.R. Miller (1974) “A Heuristic Algorithm for the Vehicle Dispatch Problem,” Operations Research, 22:340–349.

    Article  MATH  Google Scholar 

  • Glover, F. (1986) “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers & Operations Research, 13:533–549.

    Article  MATH  MathSciNet  Google Scholar 

  • Glover, F. (1989) “Tabu Search — Part I,” ORSA Journal on Computing, 1:190–206.

    MATH  MathSciNet  Google Scholar 

  • Glover, F. and M. Laguna (1993) “Tabu Search,” in Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves (ed.), Blackwell, Oxford, 70–150.

    Google Scholar 

  • Glover, F. and M. Laguna (1997) Tabu Search. Kluwer, Boston.

    MATH  Google Scholar 

  • Golden, B.L., A.A. Assad and E.A. Wasil (2002) “Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and News-paper Industries,” in The Vehicle Routing Problem, P. Toth and D. Vigo (eds), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 245–286.

    Google Scholar 

  • Golden, B.L., E.A. Wasil, J.P. Kelly and I-M. Chao (1998) “Metaheuristics in Vehicle Routing,” in Fleet Management and Logictics, T.G. Crainic and G. Laporte (eds), Kluwer, Boston, 33–56.

    Google Scholar 

  • Hadjiconstantinou, E.A., N. Christofides and A. Mingozzi (1995) “A New Exact Algorithm for the Vehicle Routing Problem Based on q-Paths and k-Shortest Paths Relaxation,” Annals of Operations Research, 61:21–43.

    Article  MathSciNet  MATH  Google Scholar 

  • Hertz, A. and D. de Werra (1991) “The Tabu Search Metaheuristic: How We Used It,” Annals of Mathematics and Artificial Intelligence, 1:111–121.

    Article  Google Scholar 

  • Kinderwater, G.A.P. and M.W.P. Savelsbergh (1997) “Vehicle Routing: Han-dling Edge Exchanges,” in Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra (eds). Wiley, Chichester, 337–360.

    Google Scholar 

  • Laporte, G. and F. Semet (2002) “Classical Heuristics for the Capacitated VRP,” in The Vehicle Routing Problem, P. Toth and D. Vigo (eds), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 109–128.

    Google Scholar 

  • Lin, S. (1965) “Computer Solution of the Traveling Salesman Problem,” Bell System Technical Journal, 44:2245–2269.

    MATH  MathSciNet  Google Scholar 

  • Mester, D. and O. Briiysy (2005) “Active Guided Evolution Strategies for the Large Scale Vehicle Routing Problems with Time Windows,” Computers & Operations Research, forthcoming.

    Google Scholar 

  • Naddef, D. and G. Rinaldi (2002) “Branch-and-Cut Algorithms for the VRP,” in The Vehicle Routing Problem, P. Toth and D. Vigo (eds), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 53–84.

    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. (1991) “Metastrategy Simulated Annealing and Tabu Search Algorithms for Combinatorial Optimization Problems,” Ph.D. Thesis, The Management School, Imperial College, London.

    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 

  • Potvin, J.-Y. and J.-M. Rousseau (1995) “An Exchange Heuristic for Routing Problems with Time Windows,” Journal of the Operational Research Society, 46:1433–3446.

    MATH  Google Scholar 

  • Rego, C. (1998) “A Subpath Ejection Method for the Vehicle Routing Problem,” Management Science, 44:1447–1459.

    MATH  Google Scholar 

  • Rego, C. and C. Roucairol (1996) “A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem,” In Meta-Heuristics: Theory and Applications, Kluwer, Boston, 661–675.

    Google Scholar 

  • Renaud, J., F.F. Boctor and G. Laporte (1996) “A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem,” INFORMS Journal on Computing, 8:134–143.

    MATH  Google Scholar 

  • Rochat, Y. and É.D. Taillard (1995) “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing,” Journal of Heuristics, 1:147–167.

    MATH  Google Scholar 

  • Taillard, É.D. (1991) “Robust Taboo Search for the Quadratic Assignment Problem,” Parallel Computing, 17:433–445.

    Article  MathSciNet  Google Scholar 

  • Taillard, É.D. (1992) “Parallel Heuristic Search Methods for the Vehicle Routing Problem,” Working Paper ORWP 92/03, Département de mathématiques, École Fédérale Polytechnique de Lausanne, Switzerland.

    Google Scholar 

  • Taillard, É.D. (1993) “Parallel Iterative Search Methods for Vehicle Routing Problem,” Networks, 23:661–673.

    MATH  Google Scholar 

  • Taillard, É.D. (1994) “Parallel Taboo Search Techniques for the Job Shop Scheduling Problem,” ORSA Journal on Computing, 6:108–117.

    MATH  Google Scholar 

  • Thompson, P.M. and H.N. Psaraftis (1993) “Cyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems,” Operations Research, 41:935–946.

    MathSciNet  MATH  Google Scholar 

  • Toth, P. and D. Vigo (2003) “The Granular Tabu Search and its Application to the Vehicle Routing Problems,” INFORMS Journal on Computing, 15:333–346.

    Article  MathSciNet  Google Scholar 

  • Toth, P. and D. Vigo (2002) “An Overview of Vehicle Routing Problems,” in The Vehicle Routing Problem, P. Toth and D. Vigo (eds), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1–26.

    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, 1994.

    Google Scholar 

  • Volgenant, A. and R. Jonker (1983) “The Symmetric Traveling Salesman Problem and Edge Exchanges in Minimal 1-Tree,” European Journal of Operational Research, 12:394–403.

    Article  MathSciNet  MATH  Google Scholar 

  • Xu, J. and J.P. Kelly (1996) “A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem,” Transportation Science, 30:379–393.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Distribution Management & GERAD, HEC Montréal, 3000ch Côte-Sainte-Catherine, Montrial, Canada, H3T2A7

    Jean-Francois Cordeau (Canada Research Chair) & Gilbert Laporte (Canada Research Chair)

Authors
  1. Jean-Francois Cordeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gilbert Laporte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Oklahoma State University, USA

    Ramesh Sharda

  2. Universität Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Kluwer Academic Publishers

About this chapter

Cite this chapter

Cordeau, JF., Laporte, G. (2005). Tabu Search Heuristics for the Vehicle Routing Problem. In: Sharda, R., Voß, S., Rego, C., Alidaee, B. (eds) Metaheuristic Optimization via Memory and Evolution. Operations Research/Computer Science Interfaces Series, vol 30. Springer, Boston, MA. https://doi.org/10.1007/0-387-23667-8_6

Download citation

Publish with us

Policies and ethics

Search

Navigation