Dispatch optimisation in O2O on-demand service with crowd-sourced and in-house drivers

被引:23
作者
Tao, Jiawei [1 ]
Dai, Hongyan [2 ]
Jiang, Hai [1 ]
Chen, Weiwei [3 ]
机构
[1] Tsinghua Univ, Dept Ind Engn, Beijing, Peoples R China
[2] Cent Univ Finance & Econ, Dept Supply Chain & Operat Management, Beijing, Peoples R China
[3] Rutgers State Univ, Dept Supply Chain Management, New Brunswick, NJ USA
基金
中国国家自然科学基金;
关键词
Dispatching; routing; crowd-sourcing; O2O; on-demand service; VEHICLE-ROUTING PROBLEM;
D O I
10.1080/00207543.2020.1800120
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
O2O (Online to Offline) services enable customers to place orders online and receive products/services offline. In addition to traditional in-house drivers, the emergence of crowd-sourced drivers provides an opportunity to re-organise offline delivery services. In practice, three types of workforce, namely, in-house, full-time, and part-time crowd-sourced drivers, coexist in the system while exhibiting different characteristics. This situation creates challenges for the management of order assignment and routing. In particular, we study three settings in response to different driver preferences: the guaranteed minimum daily number of orders for full-time drivers; the maximally allowed number of orders per trip; and the detour proportion for part-time drivers. This paper aims to provide a method for O2O platforms to optimise order assignment and routing, considering these designs about driver preferences. We further validate our model and study managerial insights using real datasets. Specifically, the results show that among all designed parameters for the O2O on-demand delivery system, two parameters - the maximally allowed number of orders per trip and the detour proportion - are critical for the design. Moreover, we find that incentive mechanisms for inexperienced and experienced drivers are different because of their service capacities. The managerial insights are expected to guide practitioners.
引用
收藏
页码:6054 / 6068
页数:15
相关论文
共 22 条
[1]   Optimization for dynamic ride-sharing: A review [J].
Agatz, Niels ;
Erera, Alan ;
Savelsbergh, Martin ;
Wang, Xing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :295-303
[2]   The Vehicle Routing Problem with Occasional Drivers [J].
Archetti, Claudia ;
Savelsbergh, Martin ;
Speranza, M. Grazia .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (02) :472-480
[3]  
Arslan A, 2018, TRANSPORT SCI, V53, P1
[4]  
BAI J, 2018, MANUFACTURING SERVIC, V21, P556, DOI DOI 10.1287/MS0M.2018.0707
[5]  
Banerjee S, 2015, Proceedings 3rd IAPR Asian Conference on Pattern Recognition ACPR 2015, P630, DOI 10.1109/ACPR.2015.7486579
[6]   The Role of Surge Pricing on a Service Platform with Self-Scheduling Capacity [J].
Cachon, Gerard P. ;
Daniels, Kaitlin M. ;
Lobel, Ruben .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2017, 19 (03) :368-384
[7]   A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem [J].
Coslovich, Luca ;
Pesenti, Raffaele ;
Ukovich, Walter .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (03) :1605-1615
[8]   O2O on-demand delivery optimization with mixed driver forces [J].
Dai, Hongyan ;
Tao, Jiawei ;
Jiang, Hai ;
Chen, Weiwei .
IFAC PAPERSONLINE, 2019, 52 (13) :391-396
[9]  
Dai Hongyan, 2019, ANN OPER RES, V2019
[10]  
Dong Jing, 2017, WORKING PAPER