Modeling and Optimization of Vehicle Routing and Arc Routing Problems

Jean-Francois Cordeau () and Gilbert Laporte ()
Additional contact information
Jean-Francois Cordeau: HEC Montreal
Gilbert Laporte: HEC Montreal

Chapter Chapter 6 in Handbook on Modelling for Discrete Optimization, 2006, pp 151-191 from Springer

Abstract: Abstract This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing problems. Exact methods (mostly based on branch-and-cut) and heuristics (mostly based on tabu search) are described, and computational results are presented.

Keywords: vehicle routing problem; arc routing problems; models; algorithms; branch-and-cut; metaheuristics; tabu search; variable neighbourhood search (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (3)

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:isochp:978-0-387-32942-0_6

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

DOI: 10.1007/0-387-32942-0_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().