Classical and modern heuristics for the vehicle routing problem |
| |
| Authors: | G. Laporte M. Gendreau J-Y. Potvin F. Semet |
| |
| Affiliation: | GERAD and École des Hautes Études Commerciales, Montréal, Canada;Département d'informatique et recherche opérationnelle and Centre de recherche sur les transports, Universitéde Montréal, Canada;Département d'informatique et recherche opérationnelle and Centre de recherche sur les transports, Universitéde Montréal, Canada;Universitéde Valenciennes et du Hainaut-Cambresis, LAMIH, 59303 Valenciennes Cedex, France |
| |
| 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. |
| |
| Keywords: | Routing Search algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
