A tabu search heuristic for the heterogeneous fleet vehicle routing problem

Authors
Gendreau, M Laporte, G Musaraganyi, C Taillard, ED
Citation
M. Gendreau et al., A tabu search heuristic for the heterogeneous fleet vehicle routing problem, COMPUT OPER, 26(12), 1999, pp. 1153-1173
Citations number
14
Categorie Soggetti
Engineering Management /General
Journal title
COMPUTERS & OPERATIONS RESEARCH
ISSN journal
03050548 → ACNP
Volume
26
Issue
12
Year of publication
1999
Pages
1153 - 1173
Database
ISI
SICI code
0305-0548(199910)26:12<1153:ATSHFT>2.0.ZU;2-0
Abstract
The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical Vehicle Routing Problem in which customers are served by a hetero geneous fleet of vehicles with various capacities, fixed costs, and variabl e costs. This article describes a tabu search heuristic for the HVRP. On a set of benchmark instances, it consistently produces high-quality solutions , including several new best-known solutions.