Skip to main content
SpringerLink
Log in

Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search

  • Conference paper
Network Optimization (INOC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6701))

Included in the following conference series:

Abstract

We introduce a parallel iterated tabu search heuristic for solving eight different variants of the vehicle routing problem. Through extensive computational results we show that the proposed heuristic is both general and competitive with specific heuristics designed for each problem type.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. Alegre, J., Laguna, M., Pacheco, J.: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. European Journal of Operational Research 179, 736–746 (2007)

    Article  MATH  Google Scholar 

  2. Beltrami, E.J., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4, 65–94 (1974)

    Article  MATH  Google Scholar 

  3. Braysy, O., Gendreau, M.: Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science 39, 119–139 (2005)

    Article  Google Scholar 

  4. Chao, I.M., Golden, B.L., Wasil, E.A.: A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am. J. Math.-S 13, 371–406 (1993)

    MATH  Google Scholar 

  5. Chao, I.M., Golden, B., Wasil, E.: A computational study of a new heuristic for the site-dependent vehicle routing problem. INFOR 37, 319–336 (1999)

    Google Scholar 

  6. Chao, I.M., Golden, B.L., Wasil, E.: An improved heuristic for the period vehicle routing problem. Networks 26, 25–44 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105–119 (1997)

    Article  MATH  Google Scholar 

  8. Cordeau, J.F., Laporte, G.: A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR 39, 292–298 (2001)

    Google Scholar 

  9. Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928–936 (2001)

    Article  MATH  Google Scholar 

  10. Cordeau, J.F., Laporte, G., Mercier, A.: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J. Oper. Res. Soc. 55, 542–546 (2004)

    Article  MATH  Google Scholar 

  11. Francis, P., Smilowitz, K., Tzur, M.: The period vehicle routing problem and its extensions. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 73–102. Springer, Berlin (2008)

    Chapter  Google Scholar 

  12. Golden, B., Raghavan, S., Wasil, E. (eds.): The Vehicle Routing Problem: Latest Advances and New Challenges, vol. 43. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  13. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 195, 791–802 (2009)

    Article  MATH  Google Scholar 

  14. Laporte, G.: Fifty years of vehicle routing. Transport Science 43, 408–416 (2009)

    Article  Google Scholar 

  15. Lourenço, H., Martin, O., Stülze, T.: Iterated local search. In: Handbook of Metaheuristics, ch. 11, pp. 321–353. Kluwer Academic Publisher, Dordrecht (2003)

    Google Scholar 

  16. Maischberger, M.: Routing of vehicles. From point to point trips to fleet routing. Ph.D. thesis, Università degli Studi di Firenze (2010)

    Google Scholar 

  17. Mester, D., Bräysy, O.: Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers & Operations Research 32, 1593–1614 (2005)

    Article  MATH  Google Scholar 

  18. Nag, B., Golden, B., Assad, A.: Vehicle routing with site dependencies. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 149–159. North-Holland, Amsterdam (1988)

    Google Scholar 

  19. Nagata, Y., Bräysy, O.: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54, 205–215 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Nagata, Y., Bräysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research 37, 724–737 (2010)

    Article  MATH  Google Scholar 

  21. Pirkwieser, S., Raidl, G.R.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Prodhon, C. (ed.) Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing (2008)

    Google Scholar 

  22. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34, 2403–2435 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  23. Polacek, M., Benkner, S., Doerner, K., Hartl, R.F.: A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. BuR Business Research Journal 1 (2008)

    Google Scholar 

  24. Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10, 613–627 (2004)

    Article  Google Scholar 

  25. Prins, C.: A GRASP × evolutionary local search hybrid for the vehicle routing problem. In: Bio-inspired Algorithms for the Vehicle Routing Problem, pp. 35–53. Springer, Berlin (2009)

    Chapter  Google Scholar 

  26. Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research 23, 229–235 (1996)

    Article  MATH  Google Scholar 

  27. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Discrete Mathematics and Applications. SIAM, Philadelphia (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Global Optimization Laboratory and DSI, Università degli Studi di Firenze, Via di S. Marta 3, 50139, Firenze, Italy

    Mirko Maischberger

  2. Canada Research Chair in Logistics and Transportation and CIRRELT, HEC Montráal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada, H3T 2A7

    Jean-François Cordeau

Authors
  1. Mirko Maischberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-François Cordeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Julia Pahl  & Stefan Voß  & 

  2. School of Information Systems, Curtin University, 6845, Perth, WA, Australia

    Torsten Reiners

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maischberger, M., Cordeau, JF. (2011). Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21527-8_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21526-1

  • Online ISBN: 978-3-642-21527-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation