Title: Classical and modern heuristics for the vehicle routing problem
Abstract: 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.
Publication Year: 2000
Publication Date: 2000-09-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 665
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot