Title of article
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
Author/Authors
Bruce L. Golden، نويسنده , , Gilbert Laporte، نويسنده , , Eric D. Taillard، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 1997
Pages
8
From page
445
To page
452
Abstract
We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the m-Travelling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.
Journal title
Computers and Operations Research
Serial Year
1997
Journal title
Computers and Operations Research
Record number
926835
Link To Document