To split or not to split: That is the question

被引:82
作者
Archetti, Claudia
Savelsbergh, Martin W. P. [1 ]
Speranza, M. Grazia
机构
[1] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
[2] Univ Brescia, Dept Quantitat Methods, I-25122 Brescia, Italy
关键词
vehicle routing; split deliveries;
D O I
10.1016/j.tre.2006.04.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
In distribution problems, a fleet of vehicles serves the demand of a set of customers. Each customer is typically served by a single vehicle. However, more cost effective distribution plans may exist if some customers are served by more than one vehicle, i.e., if some deliveries are split. We characterize distribution environments in which allowing split deliveries is likely to be beneficial. We show, through an empirical study, that the largest benefits are obtained when mean customer demand is a little over half the vehicle capacity and customer demand variance is relatively small. (C) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:114 / 123
页数:10
相关论文
共 5 条
[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]   SAVINGS BY SPLIT DELIVERY ROUTING [J].
DROR, M ;
TRUDEAU, P .
TRANSPORTATION SCIENCE, 1989, 23 (02) :141-145
[4]   ALGORITHMS FOR THE VEHICLE-ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS [J].
SOLOMON, MM .
OPERATIONS RESEARCH, 1987, 35 (02) :254-265
[5]   The granular tabu search and its application to the vehicle-routing problem [J].
Toth, P ;
Vigo, D .
INFORMS JOURNAL ON COMPUTING, 2003, 15 (04) :333-346