IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v73y2025i2p595-612.html

Robust Workforce Management with Crowdsourced Delivery

Author

Listed:
  • Chun Cheng

    (School of Economics and Management, Dalian University of Technology, Dalian 116024, China)

  • Melvyn Sim

    (Department of Analytics and Operations, NUS Business School, National University of Singapore, Singapore 119245)

  • Yue Zhao

    (Institute of Operations Research and Analytics, National University of Singapore, Singapore 117602)

Abstract

We investigate how crowdsourced delivery platforms with both contracted and ad hoc couriers can effectively manage their workforce to meet delivery demands amidst uncertainties. Our objective is to minimize the hiring costs of contracted couriers and the crowdsourcing costs of ad hoc couriers, while considering the uncertain availability and behavior of the latter. Because of the complication of calibrating these uncertainties through data-driven approaches, we instead introduce a basic reduced information model to estimate the upper bound of the crowdsourcing cost and a generalized reduced information model to obtain a tighter bound. Subsequently, we formulate a robust satisficing model associated with the generalized reduced information model and show that a binary search algorithm can tackle the model exactly by solving a modest number of convex optimization problems. Our numerical tests using Solomon’s data sets show that reduced information models provide decent approximations for practical delivery scenarios. Simulation tests further demonstrate that the robust satisficing model has better out-of-sample performance than the empirical optimization model that minimizes the total cost under historical scenarios.

Suggested Citation

  • Chun Cheng & Melvyn Sim & Yue Zhao, 2025. "Robust Workforce Management with Crowdsourced Delivery," Operations Research, INFORMS, vol. 73(2), pages 595-612, March.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:2:p:595-612
    DOI: 10.1287/opre.2023.0125
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.0125
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2023.0125?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
    ---><---

    References listed on IDEAS

    as
    1. Herbert A. Simon, 1955. "A Behavioral Model of Rational Choice," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 69(1), pages 99-118.
    2. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    3. Marlin Ulmer & Martin Savelsbergh, 2020. "Workforce Scheduling in the Era of Crowdsourced Delivery," Transportation Science, INFORMS, vol. 54(4), pages 1113-1133, July.
    4. 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.
    5. 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.
    6. Feng Liu & Zhi Chen & Shuming Wang, 2023. "Globalized Distributionally Robust Counterpart," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1120-1142, September.
    7. Fabian Torres & Michel Gendreau & Walter Rei, 2022. "Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows," Transportation Science, INFORMS, vol. 56(3), pages 631-653, May.
    8. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    9. Lucy Gongtao Chen & Qinshen Tang, 2022. "Supply Chain Performance with Target-Oriented Firms," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1714-1732, May.
    10. James E. Smith & Robert L. Winkler, 2006. "The Optimizer's Curse: Skepticism and Postdecision Surprise in Decision Analysis," Management Science, INFORMS, vol. 52(3), pages 311-322, March.
    11. Mao, James C T, 1970. "Survey of Capital Budgeting: Theory and Practice," Journal of Finance, American Finance Association, vol. 25(2), pages 349-360, May.
    12. Yu Zhang & Zhenzhen Zhang & Andrew Lim & Melvyn Sim, 2021. "Robust Data-Driven Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 69(2), pages 469-485, March.
    13. Joel Goh & Nicholas G. Hall, 2013. "Total Cost Control in Project Management via Satisficing," Management Science, INFORMS, vol. 59(6), pages 1354-1372, June.
    14. Xin Chen & Menglong Li, 2021. "Discrete Convex Analysis and Its Applications in Operations: A Survey," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1904-1926, June.
    15. 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.
    16. Minglong Zhou & Melvyn Sim & Shao‐Wei Lam, 2022. "Advance admission scheduling via resource satisficing," Production and Operations Management, Production and Operations Management Society, vol. 31(11), pages 4002-4020, November.
    17. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    18. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    19. Adam Behrendt & Martin Savelsbergh & He Wang, 2023. "A Prescriptive Machine Learning Method for Courier Scheduling on Crowdsourced Delivery Platforms," Transportation Science, INFORMS, vol. 57(4), pages 889-907, July.
    20. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    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. Zhang, Jing & Zhang, Yu & Baldacci, Roberto & Tang, Jiafu, 2026. "Workforce planning for meal deliveries with Ad-Hoc drivers: A distributionally robust contextual optimization approach," European Journal of Operational Research, Elsevier, vol. 330(2), pages 427-443.
    2. Chen, Qingxin & Ma, Shoufeng & Fu, Chenyi & Zhu, Ning & He, Qiao-Chu, 2025. "A robust satisficing multi-objective optimization approach for bike-sharing systems with heterogeneous user types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).

    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. Melvyn Sim & Qinshen Tang & Minglong Zhou & Taozeng Zhu, 2025. "The Analytics of Robust Satisficing: Predict, Optimize, Satisfice, Then Fortify," Operations Research, INFORMS, vol. 73(5), pages 2708-2728, September.
    2. Aliaa Alnaggar & Fatma Gzara & James Bookbinder, 2025. "Heatmap Design for Probabilistic Driver Repositioning in Crowdsourced Delivery," Transportation Science, INFORMS, vol. 59(1), pages 81-103, January.
    3. Alnaggar, Aliaa & Bhatt, Sahil, 2026. "Fleet size planning in crowdsourced delivery: Balancing service level and driver utilization," Omega, Elsevier, vol. 139(C).
    4. Li Chen & Melvyn Sim, 2025. "Robust CARA Optimization," Operations Research, INFORMS, vol. 73(3), pages 1459-1478, May.
    5. Zhou, Bingjie & Zhang, Yu & Baldacci, Roberto & Tang, Jiafu, 2026. "The service-centric Vehicle Routing Problem with Crowdshipping," European Journal of Operational Research, Elsevier, vol. 331(2), pages 495-519.
    6. Arslan, Alp & Kılcı, Fırat & Cheng, Shih-Fen & Misra, Archan, 2026. "Choice-based crowdshipping for next-day delivery services: A dynamic task display problem," European Journal of Operational Research, Elsevier, vol. 328(1), pages 336-348.
    7. Zhang, Jing & Zhang, Yu & Baldacci, Roberto & Tang, Jiafu, 2026. "Workforce planning for meal deliveries with Ad-Hoc drivers: A distributionally robust contextual optimization approach," European Journal of Operational Research, Elsevier, vol. 330(2), pages 427-443.
    8. Ding, Yi & Zhang, Linjing & Kuo, Yong-Hong & Zhang, Lianmin, 2025. "Cold chain routing for product freshness and low carbon emissions: A target-oriented robust optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 199(C).
    9. Daniel Zhuoyu Long & Melvyn Sim & Minglong Zhou, 2023. "Robust Satisficing," Operations Research, INFORMS, vol. 71(1), pages 61-82, January.
    10. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    11. Ausseil, Rosemonde & Ulmer, Marlin W. & Pazour, Jennifer A., 2024. "Online acceptance probability approximation in peer-to-peer transportation," Omega, Elsevier, vol. 123(C).
    12. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2024. "Compensation guarantees in crowdsourced delivery: Impact on platform and driver welfare," Omega, Elsevier, vol. 122(C).
    13. Xiaoqiang Cai & Daniel Zhuoyu Long & Gen Yu & Lianmin Zhang, 2024. "Multiportfolio Optimization: A Fairness-Aware Target-Oriented Model," Manufacturing & Service Operations Management, INFORMS, vol. 26(3), pages 952-971, May.
    14. 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).
    15. Zhiyuan Wang & Lun Ran & Minglong Zhou & Long He, 2025. "On the Equivalence and Performance of Distributionally Robust Optimization and Robust Satisficing Models," Manufacturing & Service Operations Management, INFORMS, vol. 27(4), pages 1295-1312, July.
    16. 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.
    17. Rouven Schur & Kai Winheller, 2025. "Optimizing last-mile delivery: a dynamic compensation strategy for occasional drivers," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(4), pages 1075-1132, December.
    18. 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.
    19. 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.
    20. 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.

    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:inm:oropre:v:73:y:2025:i:2:p:595-612. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.