This paper presents a survey of exact algorithms for various types of vehicle routing problems. Algorithms are divided into three main categories: direct search methods, dynamic programming and integer linear programming. This latter category comprises three approaches: set partitioning, vehicle flow formulations and commodity flow formulations.
Paru en juin 1985 , 62 pages
Ce cahier a été révisé en novembre 1985