Decision support for consumer direct grocery initiatives

被引:126
作者
Campbell, AM [1 ]
Savelsbergh, MWP
机构
[1] Univ Iowa, Tippie Coll Business, Dept Management Sci, Iowa City, IA 52242 USA
[2] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
关键词
e-commerce; home delivery; real-time decision making; vehicle routing; insertion heuristics; delivery windows;
D O I
10.1287/trsc.1040.0105
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Many companies with consumer direct service models, especially grocery delivery services, have found that home delivery poses an enormous logistical challenge due to the unpredictability of demand coupled with strict delivery windows and low profit margin products. These systems have proven difficult to manage effectively and could benefit from new technology, particularly to manage the interaction between order capture and order delivery. In this article, we define routing and scheduling problems that incorporate important features of this emerging business model and propose algorithms, based on insertion heuristics, for their solution. In the proposed home delivery problem, the company decides which deliveries to accept or reject as well as the time slot for the accepted deliveries so as to maximize expected profits. Computational experiments reveal the importance of an approach that integrates order capture with order delivery and demonstrates the quality and value of the proposed algorithms.
引用
收藏
页码:313 / 327
页数:15
相关论文
共 29 条
[1]  
Bagchi P. K., 1991, International Journal of Physical Distribution & Logistics Management, V21, P10, DOI 10.1108/09600039110134805
[2]   A PRIORI OPTIMIZATION [J].
BERTSIMAS, DJ ;
JAILLET, P ;
ODONI, AR .
OPERATIONS RESEARCH, 1990, 38 (06) :1019-1033
[3]   A new generation of vehicle routing research: Robust algorithms, addressing uncertainty [J].
Bertsimas, DJ ;
SimchiLevi, D .
OPERATIONS RESEARCH, 1996, 44 (02) :286-304
[4]   A VEHICLE-ROUTING PROBLEM WITH STOCHASTIC DEMAND [J].
BERTSIMAS, DJ .
OPERATIONS RESEARCH, 1992, 40 (03) :574-586
[5]   An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management [J].
Cheung, RK ;
Powell, WB .
OPERATIONS RESEARCH, 1996, 44 (06) :951-963
[6]  
COX B, 2001, INTERNETNEWS 0416
[7]  
FARMER M, 2001, NEWS COM 0709
[8]  
FENDELMAN A, 2001, EPRAIRIE COM 0424
[9]   A SUCCESSIVE LINEAR-APPROXIMATION PROCEDURE FOR STOCHASTIC, DYNAMIC VEHICLE ALLOCATION PROBLEMS [J].
FRANTZESKAKIS, LF ;
POWELL, WB .
TRANSPORTATION SCIENCE, 1990, 24 (01) :40-57
[10]   AN EXACT ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH STOCHASTIC DEMANDS AND CUSTOMERS [J].
GENDREAU, M ;
LAPORTE, G ;
SEGUIN, R .
TRANSPORTATION SCIENCE, 1995, 29 (02) :143-155