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

Stochastic scheduling and routing decisions in online meal delivery platforms with mixed force

Author

Listed:
  • Zhao, Yanlu
  • Alfandari, Laurent
  • Archetti, Claudia

Abstract

This paper investigates stochastic scheduling and routing problems in the online meal delivery (OMD) service. The huge increase in meal delivery demand requires the service providers to construct a highly efficient logistics network to deal with a large-volume of time-sensitive and fluctuating fulfillment, often using inhouse and crowdsourced drivers to secure the ambitious service quality. We aim to address the problem of developing an effective scheduling and routing policy that can handle real-life situations. To this end, we first model the dynamic problem as a Markov Decision Process (MDP) and analyze the structural properties of the optimal policy. Then we propose four integrated approaches to solve the operational level scheduling and routing problem. In addition, we provide a continuous approximation formula to estimate the bounds of required fleet size for the inhouse drivers. Numerical experiments based on a real dataset show the effectiveness of the proposed solution approaches. We also obtain several managerial insights that can help decision makers in solving similar resource allocation problems in real-time.

Suggested Citation

  • Zhao, Yanlu & Alfandari, Laurent & Archetti, Claudia, 2025. "Stochastic scheduling and routing decisions in online meal delivery platforms with mixed force," European Journal of Operational Research, Elsevier, vol. 323(1), pages 139-152.
    • Handle: RePEc:eee:ejores:v:323:y:2025:i:1:p:139-152
    DOI: 10.1016/j.ejor.2024.11.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172400897X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.11.028?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Gérard P. Cachon & Kaitlin M. Daniels & Ruben Lobel, 2017. "The Role of Surge Pricing on a Service Platform with Self-Scheduling Capacity," Manufacturing & Service Operations Management, INFORMS, vol. 19(3), pages 368-384, July.
    2. Carlos F. Daganzo, 1987. "Modeling Distribution Problems with Time Windows. Part II: Two Customer Types," Transportation Science, INFORMS, vol. 21(3), pages 180-187, August.
    3. 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.
    4. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    5. Philipp Afèche & Zhe Liu & Costis Maglaras, 2023. "Ride-Hailing Networks with Strategic Drivers: The Impact of Platform Control Capabilities on Performance," Manufacturing & Service Operations Management, INFORMS, vol. 25(5), pages 1890-1908, September.
    6. Carlos F. Daganzo, 1987. "Modeling Distribution Problems with Time Windows: Part I," Transportation Science, INFORMS, vol. 21(3), pages 171-179, August.
    7. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    8. Terry A. Taylor, 2018. "On-Demand Service Platforms," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 704-720, October.
    9. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    10. Naccache, Salma & Côté, Jean-François & Coelho, Leandro C., 2018. "The multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 269(1), pages 353-362.
    11. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    12. Marlin Ulmer & Martin Savelsbergh, 2020. "Workforce Scheduling in the Era of Crowdsourced Delivery," Transportation Science, INFORMS, vol. 54(4), pages 1113-1133, July.
    13. 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.
    14. Sheng Liu & Long He & Zuo-Jun Max Shen, 2021. "On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors," Management Science, INFORMS, vol. 67(7), pages 4095-4119, July.
    15. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
    16. Marlin W. Ulmer & Barrett W. Thomas & Ann Melissa Campbell & Nicholas Woyak, 2021. "The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times," Transportation Science, INFORMS, vol. 55(1), pages 75-100, 1-2.
    17. Yanlu Zhao & Felix Papier & Chung-Piaw Teo, 2024. "Market Thickness in Online Food Delivery Platforms: The Impact of Food Processing Times," Manufacturing & Service Operations Management, INFORMS, vol. 26(3), pages 853-872, May.
    18. Zhi-Long Chen & Hang Xu, 2006. "Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 40(1), pages 74-88, February.
    19. Goodson, Justin C. & Thomas, Barrett W. & Ohlmann, Jeffrey W., 2017. "A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs," European Journal of Operational Research, Elsevier, vol. 258(1), pages 216-229.
    20. Hongyan Dai & Peng Liu, 2020. "Workforce planning for O2O delivery systems with crowdsourced drivers," Annals of Operations Research, Springer, vol. 291(1), pages 219-245, August.
    21. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2000. "Diversion Issues in Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 34(4), pages 426-438, November.
    22. Archetti, Claudia & Savelsbergh, Martin & Speranza, M. Grazia, 2016. "The Vehicle Routing Problem with Occasional Drivers," European Journal of Operational Research, Elsevier, vol. 254(2), pages 472-480.
    23. S Salhi & G Nagy, 1999. "A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1034-1042, October.
    24. 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.
    25. Warren B. Powell & Wayne Snow & Raymond K. Cheung, 2000. "Adaptive Labeling Algorithms for the Dynamic Assignment Problem," Transportation Science, INFORMS, vol. 34(1), pages 50-66, February.
    26. Kirby Ledvina & Hanzhang Qin & David Simchi-Levi & Yehua Wei, 2022. "A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility," Operations Research, INFORMS, vol. 70(5), pages 2655-2673, September.
    27. 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.
    Full references (including those not matched with items on IDEAS)

    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. Soeffker, Ninja & Ulmer, Marlin W. & Mattfeld, Dirk C., 2022. "Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review," European Journal of Operational Research, Elsevier, vol. 298(3), pages 801-820.
    3. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2024. "An updated survey of attended home delivery and service problems with a focus on applications," Annals of Operations Research, Springer, vol. 343(2), pages 885-922, December.
    4. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
    5. Mousavi, Kianoush & Bodur, Merve & Cevik, Mucahit & Roorda, Matthew J., 2024. "Approximate dynamic programming for pickup and delivery problem with crowd-shipping," Transportation Research Part B: Methodological, Elsevier, vol. 187(C).
    6. Boysen, Nils & Emde, Simon & Schwerdfeger, Stefan, 2022. "Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand," European Journal of Operational Research, Elsevier, vol. 296(2), pages 539-556.
    7. 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.
    8. Liu, Yang & Li, Sen, 2023. "An economic analysis of on-demand food delivery platforms: Impacts of regulations and integration with ride-sourcing platforms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    9. Ausseil, Rosemonde & Ulmer, Marlin W. & Pazour, Jennifer A., 2024. "Online acceptance probability approximation in peer-to-peer transportation," Omega, Elsevier, vol. 123(C).
    10. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    11. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2024. "Compensation guarantees in crowdsourced delivery: Impact on platform and driver welfare," Omega, Elsevier, vol. 122(C).
    12. Yang, Dingtong & Hyland, Michael F. & Jayakrishnan, R., 2024. "Tackling the crowdsourced shared-trip delivery problem at scale with a novel decomposition heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    13. 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.
    14. 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.
    15. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2023. "A survey of attended home delivery and service problems with a focus on applications," 4OR, Springer, vol. 21(4), pages 547-583, December.
    16. Martin Savelsbergh & Marlin W. Ulmer, 2024. "Challenges and opportunities in crowdsourced delivery planning and operations—an update," Annals of Operations Research, Springer, vol. 343(2), pages 639-661, December.
    17. Stoia, Sara & Laganà, Demetrio & Ohlmann, Jeffrey W., 2025. "Dynamic pickup-and-delivery for collaborative platforms with time-dependent travel and crowdshipping," European Journal of Operational Research, Elsevier, vol. 322(1), pages 70-84.
    18. Martin W.P Savelsbergh & Marlin W. Ulmer, 2022. "Challenges and opportunities in crowdsourced delivery planning and operations," 4OR, Springer, vol. 20(1), pages 1-21, March.
    19. Mandal, Minakshi Punam & Santini, Alberto & Archetti, Claudia, 2025. "Tactical workforce sizing and scheduling decisions for last-mile delivery," European Journal of Operational Research, Elsevier, vol. 323(1), pages 153-169.
    20. Jingwen Wu & Lu Zhen & Xueting He & Xin Tian, 2024. "Operations optimization for third-party e-grocery platforms," Annals of Operations Research, Springer, vol. 332(1), pages 831-858, January.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:323:y:2025:i:1:p:139-152. 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.