Path relinking for the vehicle routing problem |
| |
| Authors: | Sin C Ho Michel Gendreau |
| |
| Institution: | (1) Department of Informatics, University of Bergen, Postboks 7800, N-5020 Bergen, Norway;(2) Centre de recherche sur les transports and Département d'informatique et de recherche opérationnelle, Université de Montréal, Canada |
| |
| Abstract: | This paper describes a tabu search heuristic with path relinking for the vehicle routing problem. Tabu search is a local search
method that explores the solution space more thoroughly than other local search based methods by overcoming local optima.
Path relinking is a method to integrate intensification and diversification in the search. It explores paths that connect
previously found elite solutions. Computational results show that tabu search with path relinking is superior to pure tabu
search on the vehicle routing problem. |
| |
| Keywords: | Vehicle routing Tabu search Path relinking |
| 本文献已被 SpringerLink 等数据库收录！ |
