AN ADAPTIVE MEMORY HEURISTIC FOR A CLASS OF VEHICLE-ROUTING PROBLEMS WITH MINMAX OBJECTIVE

Authors
GOLDEN BL LAPORTE G TAILLARD ED
Citation
Bl. Golden et al., AN ADAPTIVE MEMORY HEURISTIC FOR A CLASS OF VEHICLE-ROUTING PROBLEMS WITH MINMAX OBJECTIVE, Computers & operations research, 24(5), 1997, pp. 445-452
Citations number
12
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
24
Issue
5
Year of publication
1997
Pages
445 - 452
Database
ISI
SICI code
0305-0548(1997)24:5<445:AAMHFA>2.0.ZU;2-N
Abstract
We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacita ted VRP with multiple use of vehicles, and the m-Travelling Salesman P roblem with multiple use of vehicles. A tabu search based adaptive mem ory procedure of instances indicate that the method produces very good solutions within reasonable computing times. (C) 1997 Elsevier Scienc e Ltd. All rights reserved.