Premium
Classical and modern heuristics for the vehicle routing problem
Author(s) -
Laporte G.,
Gendreau M.,
Potvin JY.,
Semet F.
Publication year - 2000
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2000.tb00200.x
Subject(s) - heuristics , tabu search , metaheuristic , mathematical optimization , vehicle routing problem , computer science , routing (electronic design automation) , algorithm , mathematics , computer network
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.