Heuristics for the multi-vehicle covering tour problem

被引：87

作者：

Hachicha, M

Hodgson, MJ

Laporte, G

Semet, F

机构：

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

[2] Univ Alberta, Dept Earth & Atmospher Sci, Edmonton, AB T6G 2E3, Canada

[3] Univ Montreal, GRIS, Dept Adm Sante, Montreal, PQ H3C 3J7, Canada

[4] Univ Valenciennes & Hainaut Cambresis, Lab Informat & Math Appliquees, F-59304 Valenciennes, France

来源：

COMPUTERS & OPERATIONS RESEARCH | 2000年 / 27卷 / 01期

关键词：

covering tour; vehicle routing; savings algorithm; sweep algorithm; route-first/cluster-second;

D O I：

10.1016/S0305-0548(99)00006-4

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The multi-vehicle covering tour problem is defined on a graph G = (V boolean OR W, E), where W is a set of vertices that must collectively be covered by up to in vehicles. The problem consists of determining a set of total minimum length vehicle routes on a subset of V, subject to side constraints, such that every vertex of W is within a prespecified distance from a route. Three heuristics are developed for this problem and tested on randomly generated and real data.

引用

页码：29 / 42

页数：14

共 17 条

[1]

BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886

[2] ROUTE 1ST - CLUSTER 2ND METHODS FOR VEHICLE-ROUTING [J].