Building Trust in Home Services-Stochastic Team-Orienteering with Consistency Constraints

被引:28
作者
Song, Yongjia [1 ]
Ulmer, Marlin W. [2 ]
Thomas, Barrett W. [3 ]
Wallace, Stein W. [4 ]
机构
[1] Clemson Univ, Dept Ind Engn, Clemson, SC 29634 USA
[2] Tech Univ Carolo Wilhelmina Braunschweig, Decis Support Grp, D-38106 Braunschweig, Germany
[3] Univ Iowa, Tippie Coll Business, Iowa City, IA 52242 USA
[4] NHH Norwegian Sch Econ, Dept Business & Management Sci, N-5045 Bergen, Norway
关键词
service routing; assignment consistency; stochastic customers; team-orienteering problem; multiple scenario approach; VEHICLE-ROUTING PROBLEM; VARIABLE NEIGHBORHOOD SEARCH; MANDATORY VISITS; ALGORITHMS; TERRITORY;
D O I
10.1287/trsc.2019.0927
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we consider service applications where drivers serve subscription customers at their homes on a regular basis and at known times. To build trust with customers, the company requires that subscription customers are consistently served by the same driver. In addition to subscription customers, on-demand customers request delivery on a daily basis. For the company, the challenge is to consistently serve the subscription customers while simultaneously maximizing the daily profit from the on-demand customers. We model the problem as a two-stage stochastic decision problem. The first stage determines the assignment of drivers to subscription customers. The second stage is a team-orienteering problem with time windows and mandatory visits by fixed drivers. We present an anticipatory consistent customer assignment policy (ACCA) based on the multiple scenario approach framework. Our computational study shows that ACCA significantly outperforms consistency concepts from the literature, while increasing costs less than 5%.
引用
收藏
页码:823 / 838
页数:16
相关论文
共 51 条
[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]   The probabilistic orienteering problem [J].
Angelelli, Enrico ;
Archetti, Claudia ;
Filippi, Carlo ;
Vindigni, Michele .
COMPUTERS & OPERATIONS RESEARCH, 2017, 81 :269-281
[3]   The multi-district team orienteering problem [J].
Angelica Salazar-Aguilar, M. ;
Langevin, Andre ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 :76-82
[4]   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
[5]   Online Grocery Retail: Revenue Models and Environmental Impact [J].
Belavina, Elena ;
Girotra, Karan ;
Kabra, Ashish .
MANAGEMENT SCIENCE, 2017, 63 (06) :1781-1799
[6]   Scenario-based planning for partially dynamic vehicle routing with stochastic customers [J].
Bent, RW ;
Van Hentenryck, P .
OPERATIONS RESEARCH, 2004, 52 (06) :977-987
[7]   Incentive schemes for attended home delivery services [J].
Campbell, Ann Melissa ;
Savelsbergh, Martin .
TRANSPORTATION SCIENCE, 2006, 40 (03) :327-341
[8]   Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector [J].
Campelo, Pedro ;
Neves-Moreira, Fabio ;
Amorim, Pedro ;
Almada-Lobo, Bernardo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) :131-145
[9]   Robust Partitioning for Stochastic Multivehicle Routing [J].
Carlsson, John Gunnar ;
Delage, Erick .
OPERATIONS RESEARCH, 2013, 61 (03) :727-744
[10]   Dividing a Territory Among Several Vehicles [J].
Carlsson, John Gunnar .
INFORMS JOURNAL ON COMPUTING, 2012, 24 (04) :565-577