Classical and modern heuristics for the vehicle routing problem

Classical and modern heuristics for the vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor20012796
Country: United Kingdom
Volume: 7
Issue: 4/5
Start Page Number: 285
End Page Number: 300
Publication Date: Jul 2000
Journal: International Transactions in Operational Research
Authors: , , ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.