G-2002-30
Modeling and Optimization of Vehicle Routing and Arc Routing Problems
Jean-François Cordeau et Gilbert Laporte
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.
Paru en juin 2002 , 37 pages
Ce cahier a été révisé en septembre 2003