An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

0.00 Avg rating0 Votes
Article ID: iaor1998185
Country: United Kingdom
Volume: 24
Issue: 5
Start Page Number: 445
End Page Number: 452
Publication Date: May 1997
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

We propose an 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 indicates that the method produces very good solutions within reasonable computing times.

Reviews

Required fields are marked *. Your email address will not be published.