Classical and Modern Heuristics for the Vehicle Routing Problem

, , et

référence BibTeX

This article is a survey of heuristics for the Vehicle Routing Problem. It is divided into two parts: classical and modern heuristics. The first part contains well-known schemes such as the savings method, the sweep algorithm and various two-phase approaches. The second part is devoted to tabu search heuristics which have proved the most successful metaheuristic approach. Comparative computational results are presented.

, 18 pages

Ce cahier a été révisé en octobre 1999

Axe de recherche

Application de recherche

Document (430 Ko)