Key points are not available for this paper at this time.
Abstract 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 to be the most successful metaheuristic approach. Comparative computational results are presented.
Laporte et al. (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: