Sin C. Ho
University of Bergen, Norway
Michel Gendreau
Universitå de Montråal, Canada
Ladda ner artikel
Ingår i: Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Linköping Electronic Conference Proceedings 14:15, s.
Publicerad: 2004-12-28
ISBN:
ISSN: 1650-3686 (tryckt), 1650-3740 (online)
The aim of this work is to propose a tabu search heuristic with path relinking to solve the classical vehicle routing problem. Computational results show that using path relinking periodically in the search speeds up the search to find good solutions. They also show that tabu search with path relinking is able to produce better solutions than pure tabu search using much less computing time.
Inga referenser tillgängliga
