A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

被引：74

作者：

Petch, RJ ^{[1
]}

Salhi, S ^{[1
]}

机构：

[1] Univ Birmingham, Sch Math & Stat, Management Math Grp, Birmingham B15 2TT, W Midlands, England

来源：

DISCRETE APPLIED MATHEMATICS | 2003年 / 133卷 / 1-3期

关键词：

heuristic; population; bin-packing; multiple trip;

D O I：

10.1016/S0166-218X(03)00434-7

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the literature. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：69 / 92

页数：24

共 15 条

[1]

[Anonymous], 1990, KNAPSACK PROBLEMS

[2] A tabu search algorithm for the multi-trip vehicle routing and scheduling problem [J].

Brandao, J ;

Mercer, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 100 (01) :180-191

[3] The multi-trip vehicle routing problem [J].

Brandao, JCS ;

Mercer, A .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (08) :799-805

[4]

Christofides N., 1979, COMBINATORIAL OPTIMI

[5] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[6] OPTIMAL SOLUTION OF VEHICLE-ROUTING PROBLEMS USING MINIMUM K-TREES [J].

FISHER, ML .

OPERATIONS RESEARCH, 1994, 42 (04) :626-642

[7]

Fleischmann B., 1990, The Vehicle Routing Problem with Multiple Use of Vehicles

[8] An adaptive memory heuristic for a class of vehicle routing problems with minmax objective [J].

Golden, BL ;

Laporte, G ;

Taillard, ED .

COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (05) :445-452

[9]

Rayward-Smith V. J., 1996, MODERN HEURISTIC SEA

[10]

Rochat Y., 1995, Journal of Heuristics, V1, P147, DOI 10.1007/BF02430370

← 1 2 →