Customer acceptance mechanisms for home deliveries in metropolitan areas

被引:112
作者
Ehmke, Jan Fabian [1 ]
Campbell, Ann Melissa [1 ]
机构
[1] Univ Iowa, Dept Management Sci, Tippie Coll Business, Iowa City, IA 52242 USA
关键词
Routing; Home delivery; Feasibility check; Congestion; City logistics; VEHICLE-ROUTING PROBLEM; TRAVEL-TIMES;
D O I
10.1016/j.ejor.2013.08.028
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Efficient and reliable home delivery is crucial for the economic success of online retailers. This is especially challenging for attended home deliveries in metropolitan areas where logistics service providers face congested traffic networks and customers expect deliveries in tight delivery time windows. Our goal is to develop and compare strategies that maximize the profits of a logistics service provider by accepting as many delivery requests as possible, while assessing the potential impact of a request on the service quality of a delivery tour. Several acceptance mechanisms are introduced, differing in the amount of travel time information that is considered in the decision of whether a delivery request can be accommodated or not. A real-world inspired simulation framework is used for comparison of acceptance mechanisms with regard to profits and service quality. Computational experiments utilizing this simulation framework investigate the effectiveness of acceptance mechanisms and help identify when more advanced travel time information may be worth the additional data collection and computational efforts. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:193 / 207
页数:15
相关论文
共 29 条
[1]   Time Slot Management in Attended Home Delivery [J].
Agatz, Niels ;
Campbell, Ann ;
Fleischmann, Moritz ;
Savelsbergh, Martin .
TRANSPORTATION SCIENCE, 2011, 45 (03) :435-449
[2]   Travel time reliability in vehicle routing and scheduling with time windows [J].
Ando, Naoki ;
Taniguchi, Eiichi .
NETWORKS & SPATIAL ECONOMICS, 2006, 6 (3-4) :293-311
[3]   A dynamic vehicle routing problem with multiple delivery routes [J].
Azi, Nabila ;
Gendreau, Michel ;
Potvin, Jean-Yves .
ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) :103-112
[4]   Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints [J].
Baldacci, Roberto ;
Mingozzi, Aristide ;
Roberti, Roberto .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) :1-6
[5]   Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118
[6]   Vehicle routing problem with time windows, part II:: Metaheuristics [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :119-139
[7]   Decision support for consumer direct grocery initiatives [J].
Campbell, AM ;
Savelsbergh, MWP .
TRANSPORTATION SCIENCE, 2005, 39 (03) :313-327
[8]   Incentive schemes for attended home delivery services [J].
Campbell, Ann Melissa ;
Savelsbergh, Martin .
TRANSPORTATION SCIENCE, 2006, 40 (03) :327-341
[9]   Multiobjective path finding in stochastic dynamic networks, with application to routing hazardous materials shipments [J].
Chang, TS ;
Nozick, LK ;
Turnquist, MA .
TRANSPORTATION SCIENCE, 2005, 39 (03) :383-399
[10]   A stochastic dynamic traveling salesman problem with hard time windows [J].
Chang, Tsung-Sheng ;
Wan, Yat-wah ;
Ooi, Wei Tsang .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (03) :748-759