IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v304y2023i3p1022-1035.html
   My bibliography  Save this article

The value of personalized dispatch in O2O on-demand delivery services

Author

Listed:
  • Tao, Jiawei
  • Dai, Hongyan
  • Chen, Weiwei
  • Jiang, Hai

Abstract

In online-to-offline (O2O) on-demand services, customers place orders online and the O2O platform delivers products from stores to customers within a prescribed time. The platform usually hires crowd-sourced drivers as a cost-effective option owing to their flexibility. However, the delivery speed and delivery capacity of the crowd-sourced drivers vary considerably. This service inconsistency brings challenges in precisely matching the delivery supply and customer demand, which may significantly decrease the delivery efficiency. This study aims to address the challenges by proposing a personalized dispatch model, which integrates the order and driver’s characteristics in the order assignment and routing decisions. To achieve this objective, two machine learning-based models are proposed to forecast the delivery speed of individual drivers in real time and customize their delivery capacity dynamically to develop a portrait of each driver’s behaviour. Next, a personalized O2O order assignment and routing model is proposed with the integration of the two aforementioned models. We validate our model with a real dataset of one mainstream O2O platform in China. We run a comprehensive simulation to show the improvement in terms of on-time ratio and average delay time brought by the personalization of each characteristic, namely, delivery speed and delivery capacity. We then show that the proposed personalized model can reduce the average delay by 21.60% through comparison with actual routing decisions by the drivers,. The theoretical and numerical results shed light on the delivery management of the O2O on-demand services.

Suggested Citation

  • Tao, Jiawei & Dai, Hongyan & Chen, Weiwei & Jiang, Hai, 2023. "The value of personalized dispatch in O2O on-demand delivery services," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1022-1035.
    • Handle: RePEc:eee:ejores:v:304:y:2023:i:3:p:1022-1035
    DOI: 10.1016/j.ejor.2022.05.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722003939
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.05.019?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kursa, Miron B. & Rudnicki, Witold R., 2010. "Feature Selection with the Boruta Package," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 36(i11).
    2. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    3. Jiaru Bai & Kut C. So & Christopher S. Tang & Xiqun (Michael) Chen & Hai Wang, 2019. "Coordinating Supply and Demand on an On-Demand Service Platform with Impatient Customers," Manufacturing & Service Operations Management, INFORMS, vol. 21(3), pages 556-570, July.
    4. Stacy A. Voccia & Ann Melissa Campbell & Barrett W. Thomas, 2019. "The Same-Day Delivery Problem for Online Purchases," Service Science, INFORMS, vol. 53(1), pages 167-184, February.
    5. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    6. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    7. Jiawei Tao & Hongyan Dai & Hai Jiang & Weiwei Chen, 2021. "Dispatch optimisation in O2O on-demand service with crowd-sourced and in-house drivers," International Journal of Production Research, Taylor & Francis Journals, vol. 59(20), pages 6054-6068, October.
    8. H. Neil Geismar & Yiwei Huang & Suresh D. Pillai & Chelliah Sriskandarajah & Seokjun Youn, 2020. "Location‐Routing with Conflicting Objectives: Coordinating eBeam Phytosanitary Treatment and Distribution of Mexican Import Commodities," Production and Operations Management, Production and Operations Management Society, vol. 29(6), pages 1506-1531, June.
    9. John Gunnar Carlsson & Erick Delage, 2013. "Robust Partitioning for Stochastic Multivehicle Routing," Operations Research, INFORMS, vol. 61(3), pages 727-744, June.
    10. Markus Ettl & Pavithra Harsha & Anna Papush & Georgia Perakis, 2020. "A Data-Driven Approach to Personalized Bundle Pricing and Recommendation," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 461-480, May.
    11. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    12. Krista J. Li, 2018. "Behavior-Based Pricing in Marketing Channels," Marketing Science, INFORMS, vol. 37(2), pages 310-326, March.
    13. Schuijbroek, J. & Hampshire, R.C. & van Hoeve, W.-J., 2017. "Inventory rebalancing and vehicle routing in bike sharing systems," European Journal of Operational Research, Elsevier, vol. 257(3), pages 992-1004.
    14. Wang, Hai & Yang, Hai, 2019. "Ridesourcing systems: A framework and review," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 122-155.
    15. Iman Dayarian & Martin Savelsbergh, 2020. "Crowdshipping and Same‐day Delivery: Employing In‐store Customers to Deliver Online Orders," Production and Operations Management, Production and Operations Management Society, vol. 29(9), pages 2153-2174, September.
    16. Liu, Shan & Jiang, Hai & Chen, Shuiping & Ye, Jing & He, Renqing & Sun, Zhizhao, 2020. "Integrating Dijkstra’s algorithm into deep inverse reinforcement learning for food delivery route planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    17. Kris Johnson Ferreira & Bin Hong Alex Lee & David Simchi-Levi, 2016. "Analytics for an Online Retailer: Demand Forecasting and Price Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 69-88, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Datta, Alotosh & Sarkar, Biswajit & Dey, Bikash Koli & Sangal, Isha & Yang, Liu & Fan, Shu-Kai S. & Sardar, Suman Kalyan & Thangavelu, Lakshmi, 2024. "The impact of sales effort on a dual-channel dynamical system under a price-sensitive stochastic demand," Journal of Retailing and Consumer Services, Elsevier, vol. 76(C).
    2. Saara Hämäläinen & Vaiva Petrikaitė, 2024. "Prediction algorithms in matching platforms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 78(3), pages 979-1020, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    2. Marlin W. Ulmer & Alan Erera & Martin Savelsbergh, 2022. "Dynamic service area sizing in urban delivery," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 763-793, September.
    3. Lian, Ying & Lucas, Flavien & Sörensen, Kenneth, 2024. "Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system," European Journal of Operational Research, Elsevier, vol. 312(1), pages 338-356.
    4. Ausseil, Rosemonde & Ulmer, Marlin W. & Pazour, Jennifer A., 2024. "Online acceptance probability approximation in peer-to-peer transportation," Omega, Elsevier, vol. 123(C).
    5. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    6. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    7. Queiroz, Michell & Lucas, Flavien & Sörensen, Kenneth, 2024. "Instance generation tool for on-demand transportation problems," European Journal of Operational Research, Elsevier, vol. 317(3), pages 696-717.
    8. Auad, Ramon & Erera, Alan & Savelsbergh, Martin, 2023. "Courier satisfaction in rapid delivery systems using dynamic operating regions," Omega, Elsevier, vol. 121(C).
    9. Ouyang, Zhiyuan & Leung, Eric K.H. & Huang, George Q., 2023. "Community logistics and dynamic community partitioning: A new approach for solving e-commerce last mile delivery," European Journal of Operational Research, Elsevier, vol. 307(1), pages 140-156.
    10. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    11. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
    12. Zehtabian, Shohre & Larsen, Christian & Wøhlk, Sanne, 2022. "Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting," European Journal of Operational Research, Elsevier, vol. 303(2), pages 616-632.
    13. Lee, Enoch & Cen, Xuekai & Lo, Hong K., 2021. "Zonal-based flexible bus service under elastic stochastic demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    14. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
    15. Shi, Ziyi & Xu, Meng & Song, Yancun & Zhu, Zheng, 2024. "Multi-Platform dynamic game and operation of hybrid Bike-Sharing systems based on reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    16. LIAN, Ying & LUCAS, Flavien & SÖRENSEN, Kenneth, 2022. "On-demand bus routing problem with dynamic stochastic requests and prepositioning," Working Papers 2022004, University of Antwerp, Faculty of Business and Economics.
    17. Chen, Xinwei & Wang, Tong & Thomas, Barrett W. & Ulmer, Marlin W., 2023. "Same-day delivery with fair customer service," European Journal of Operational Research, Elsevier, vol. 308(2), pages 738-751.
    18. Hu, Xinru & Zhou, Shuiyin & Luo, Xiaomeng & Li, Jianbin & Zhang, Chi, 2024. "Optimal pricing strategy of an on-demand platform with cross-regional passengers," Omega, Elsevier, vol. 122(C).
    19. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    20. Zhong, Yuanguang & Lan, Yibo & Chen, Zhi & Yang, Jiazi, 2023. "On-demand ride-hailing platforms with heterogeneous quality-sensitive customers: Dedicated system or pooling system?," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 247-266.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:304:y:2023:i:3:p:1022-1035. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.