New Heuristics for the Vehicle Routing Problem

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

Chapter Chapter 9 in Logistics Systems: Design and Optimization, 2005, pp 279-297 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (23)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-24977-3_9

Ordering information: This item can be ordered from
http://www.springer.com/9780387249773

DOI: 10.1007/0-387-24977-X_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().