The split delivery vehicle routing problem with minimum delivery amounts

被引：49

作者：

Gulczynski, Damon ^{[1
]}

Golden, Bruce ^{[2
]}

Wasil, Edward ^{[3
]}

机构：

[1] Univ Maryland, Dept Math, College Pk, MD 20742 USA

[2] Univ Maryland, Robert H Smith Sch Business, College Pk, MD 20742 USA

[3] American Univ, Kogod Sch Business, Washington, DC 20016 USA

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2010年 / 46卷 / 05期

关键词：

Vehicle routing problem; Heuristics; Mixed integer program; ALGORITHMS; SAVINGS;

D O I：

10.1016/j.tre.2009.12.007

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

In the vehicle routing problem, a fleet of vehicles must service the demands of customers in a least-cost way. By allowing multiple vehicles to service the same customer (i.e., splitting deliveries), substantial savings in travel costs are possible. However, split deliveries are often an inconvenience to the customer who would prefer to have demand serviced in a single visit. We consider the vehicle routing problem in which split deliveries are allowed only if a minimum fraction of a customer's demand is serviced by a vehicle. We develop a heuristic method for solving this problem and report computational results on a wide range of problem sets. (C) 2009 Elsevier Ltd. All rights reserved.

引用

页码：612 / 626

页数：15

共 27 条

[1] Worst-case analysis for split delivery vehicle routing problems [J].

Archetti, C ;

Savelsbergh, MWP ;

Speranza, MG .

TRANSPORTATION SCIENCE, 2006, 40 (02) :226-234

[2] A tabu search algorithm for the split delivery vehicle routing problem [J].

Archetti, C ;

Speranza, MG ;

Hertz, A .

TRANSPORTATION SCIENCE, 2006, 40 (01) :64-73

[3] Vehicle routing in the 1-skip collection problem [J].

Archetti, C ;

Speranza, MG .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (07) :717-727

[4] To split or not to split: That is the question [J].

Archetti, Claudia ;

Savelsbergh, Martin W. P. ;

Speranza, M. Grazia .

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (01) :114-123

[5]

Archetti C, 2008, OPER RES COMPUT SCI, V43, P103, DOI 10.1007/978-0-387-77778-8_5

[6] A lower bound for the split delivery vehicle routing problem [J].

Belenguer, JM ;

Martinez, MC ;

Mota, E .

OPERATIONS RESEARCH, 2000, 48 (05) :801-810

[7] Ship routing and scheduling with flexible cargo sizes [J].

Bronmo, G. ;

Christiansen, M. ;

Nygreen, B. .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (09) :1167-1177

[8]

Campbell AM, 2002, SIAM MONOG DISCR MAT, P309

[9] The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results [J].

Chen, Si ;

Golden, Bruce ;

Wasil, Edward .

NETWORKS, 2007, 49 (04) :318-329

[10] AN ALGORITHM FOR VEHICLE-DISPATCHING PROBLEM [J].

CHRISTOF.N ;

EILON, S .

OPERATIONAL RESEARCH QUARTERLY, 1969, 20 (03) :309-&

← 1 2 3 →