Skip to main content

Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography

  • Chapter
The Vehicle Routing Problem: Latest Advances and New Challenges

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

Summary

We provide a categorized bibliography of metaheuristics for solving the vehicle routing problem and its extensions. The categories are based on various types of metaheuristics and vehicle routing problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 379.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

  1. O. Bräysy and M. Gendreau. Vehicle routing problem with time windows, Part II: Metaheuristics.Transportation Science, 39:119–139, 2005.

    Article  Google Scholar 

  2. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon and F. Soumis. VRP with Time Windows,Chapter 7 inThe Vehicle Routing Problem, P.Toth and D.Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 157–194, 2002.

    Google Scholar 

  3. G. Desaulniers, J. Desrosiers, A. Erdmann, M. M.Solomon and F. Soumis. VRP with Pickup and Delivery, Chapter 9 inThe Vehicle Routing Problem, P.Toth and D.Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 225–242, 2002.

    Google Scholar 

  4. M. Dorigo and T. Stützle.Ant Colony Optimization. The MIT Press, Cambridge, MA, 2004.

    Google Scholar 

  5. J. Dreacuteeo, A. Pétrowski, P. Siarry, and É. Taillard.Métaheuristiques pour l’Optimisation Difficile. Eyrolles, France, 2003.

    Google Scholar 

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

    Article  Google Scholar 

  7. G. Dueck and T. Scheuer. Threshold Accepting: a general purpose optimization algorithm.Journal of Computational Physics, 90:161–175, 1990.

    Article  Google Scholar 

  8. T. Etezadi and J. E. Beasley. Vehicle fleet composition.Journal of the Operational Research Society, 34:87–91, 1983.

    Article  Google Scholar 

  9. M. Gendreau, G. Laporte, and J.-Y. Potvin. Metaheuristics for the Capacitated VRP, Chapter 6 inThe Vehicle Routing Problem, P.Toth and D.Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 129–154, 2002.

    Google Scholar 

  10. M. Gendreau and J.-Y. Potvin. Dynamic Vehicle Routing and Dispatching, Chapter 5 inFleet Management and Logistics, T.G.Crainic and G.Laporte, eds., Kluwer, Boston,115–126, 1998.

    Google Scholar 

  11. F. Glover. Future paths for integer programming and links to artificial intelligence.Computers & Operations Research, 13:533–549, 1986.

    Article  Google Scholar 

  12. F. Glover and M. Laguna.Tabu Search.Kluwer, Boston, MA, 1997.

    Google Scholar 

  13. F. Glover and G. A. Kochenberger.Handbook of Metaheuristics. Kluwer, Boston, MA, 2003.

    Google Scholar 

  14. D. E. Goldberg.Genetic Algorithms in Search, Optimization & Learning. Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  15. P. Hansen and N. Mladenović.Variable Neighborhood Search. Chapter 6 inHandbook of Metaheuristics,F. Glover and G.A.Kochenberger, eds., Kluwer, 145–184, 2003.

    Google Scholar 

  16. P. J. M. van Laarhoven and E. H. L. Aarts.Simulated Annealing: Theory and Applications. Springer, Dordrecht, 1987.

    Google Scholar 

  17. H.N.Psaraftis. Dynamic Vehicle Routing Problems. Chapter 11 inVehicle Routing: Methods and Studies, B.L.Golden and A.A.Assad, eds., North-Holland, Amsterdam, 223–248, 1988.

    Google Scholar 

  18. M.G.C.Resende and C.C.Ribeiro. Greedy Randomized Adaptive Search Procedures. Chapter 8 inHandbook of Metaheuristics, F. Glover and G.A.Kochenberger, eds., Kluwer, 219–249, 2003.

    Google Scholar 

  19. P. Toth and D. Vigo.The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 2002.

    Google Scholar 

  20. P. Toth and D. Vigo. VRP with Backhauls, Chapter 8 inThe Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 195–224, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michel Gendreau .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gendreau, M., Potvin, JY., Bräumlaysy, O., Hasle, G., Løkketangen, A. (2008). Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_7

Download citation

Publish with us

Policies and ethics