Modeling and Optimization of Vehicle Routing and Arc Routing Problems


référence BibTeX

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.

, 37 pages

Ce cahier a été révisé en septembre 2003

Axe de recherche

Application de recherche


Modeling and optimization of vehicle routing and arc routing problems
G. Appa, L. Pitsoulis, H.P. Williams (eds.), Handbook on Modelling for Discrete Optimization, 151–191, 2006 référence BibTeX