| Article ID: | iaor20002108 |
| Country: | United Kingdom |
| Volume: | 26 |
| Issue: | 12 |
| Start Page Number: | 1153 |
| End Page Number: | 1173 |
| Publication Date: | Oct 1999 |
| Journal: | Computers and Operations Research |
| Authors: | Laporte Gilbert, Gendreau Michel, Taillard ric D., Musaraganyi Christophe |
| Keywords: | heuristics |
The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical Vehicle Routing Problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs, and variable 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.