Article | Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society | Path Relinking for the Vehicle Routing Problem

Title:
Path Relinking for the Vehicle Routing Problem
Author:
Sin C. Ho: University of Bergen, Norway Michel Gendreau: Universitå de Montråal, Canada
Download:
Full text (pdf)
Year:
2004
Conference:
Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Issue:
014
Article no.:
015
No. of pages:
1
Publication type:
Abstract
Published:
2004-12-28
Series:
Linköping Electronic Conference Proceedings
ISSN (print):
1650-3686
ISSN (online):
1650-3740
Publisher:
Linköping University Electronic Press; Linköpings universitet


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.

Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society

Author:
Sin C. Ho, Michel Gendreau
Title:
Path Relinking for the Vehicle Routing Problem
References:
No references available

Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society

Author:
Sin C. Ho, Michel Gendreau
Title:
Path Relinking for the Vehicle Routing Problem
Note: the following are taken directly from CrossRef
Citations:
No citations available at the moment