A tabu search heuristic for the heterogeneous fleet vehicle routing problem

被引：148

作者：

Gendreau, M

Laporte, G

Musaraganyi, C

Taillard, ÉD

机构：

[1] Univ Montreal, Ctr Rech Transports, Montreal, PQ H3C 3J7, Canada

[2] Univ Montreal, Dept Informat & Rech Operat, Montreal, PQ H3C 3J7, Canada

[3] Ecole Hautes Etud Commerciales, Serv Enseignement Methodes Quantitat Gest, Montreal, PQ H3T 2A7, Canada

[4] Free Univ Brussels, Serv Math Gest, B-1050 Brussels, Belgium

[5] IDSIA, CH-6900 Lugano, Switzerland

来源：

COMPUTERS & OPERATIONS RESEARCH | 1999年 / 26卷 / 12期

基金：

加拿大自然科学与工程研究理事会;

关键词：

heterogeneous fleet vehicle routing problem; fleet mix; tabu search heuristic;

D O I：

10.1016/S0305-0548(98)00100-2

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：1153 / 1173

页数：21

共 15 条

[1]

Cordeau JF, 1997, NETWORKS, V30, P105, DOI 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO

[2]

2-G

[3] A NEW HEURISTIC FOR THE FLEET SIZE AND MIX VEHICLE-ROUTING PROBLEM [J].