IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v70y2024i6p3789-3807.html

Courier Dispatch in On-Demand Delivery

Author

Listed:
  • Mingliu Chen

    (Naveen Jindal School of Management, The University of Texas at Dallas, Richardson, Texas 75074)

  • Ming Hu

    (Rotman School of Management, University of Toronto, Toronto, Ontario M5S 1A1, Canada)

Abstract

We study a courier dispatching problem in an on-demand delivery system in which customers are sensitive to delay. Specifically, we evaluate the effect of temporal pooling by comparing systems using the dedicated strategy, with which only one order is delivered per trip, versus the pooling strategy, with which a batch of consecutive orders is delivered on each trip. We capture the courier delivery system’s spatial dimension by assuming that, following a Poisson process, demand arises at a uniformly generated point within a service region. With the same objective of revenue maximization, we find that the dispatching strategy depends critically on customers’ patience level, the size of the service region, and whether the firm can endogenize the demand. We obtain concise but informative results with a single courier and assuming that customers’ underlying arrival rate is large enough, meaning a crowded market, such as rush hour delivery. In particular, when the firm has a growth target and needs to achieve an exogenously given demand rate, using the pooling strategy is optimal if the service area is large enough to fully exploit the pooling efficiency in delivery. Otherwise, using the dedicated strategy is optimal. In contrast, if the firm can endogenize the demand rate by varying the delivery fee, using the dedicated strategy is optimal for a large service area. The reason is that it is optimal for the firm to sustain a relatively low demand rate by charging a high fee for a large service radius: within this large area, the pooling strategy leads to a long wait because it takes a long time for multiple orders to accumulate. Moreover, with an exogenous demand rate to meet, customers’ patience level has no impact on the dispatch strategy. However, when the demand rate can be endogenized, the dedicated strategy is preferable if customers are impatient. Furthermore, we extend our model to account for social welfare maximization, a hybrid contingent delivery policy, a general arrival rate that does not have to be large, a nonuniform distribution of orders in the service region, and multiple couriers. We also conduct numerical analysis and simulations to complement our main results and find that most insights in our base model still hold in these extensions and numerical studies.

Suggested Citation

  • Mingliu Chen & Ming Hu, 2024. "Courier Dispatch in On-Demand Delivery," Management Science, INFORMS, vol. 70(6), pages 3789-3807, June.
  • Handle: RePEc:inm:ormnsc:v:70:y:2024:i:6:p:3789-3807
    DOI: 10.1287/mnsc.2023.4858
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2023.4858
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2023.4858?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. 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.
    2. Guiyun Feng & Guangwen Kong & Zizhuo Wang, 2021. "We Are on the Way: Analysis of On-Demand Ride-Hailing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 23(5), pages 1237-1256, September.
    3. Ho-Yin Mak, 2022. "Enabling Smarter Cities with Operations Management," Manufacturing & Service Operations Management, INFORMS, vol. 24(1), pages 24-39, January.
    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. 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.
    6. Junyu Cao & Mariana Olvera-Cravioto & Zuo-Jun (Max) Shen, 2020. "Last-Mile Shared Delivery: A Discrete Sequential Packing Approach," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1466-1497, November.
    7. Manlu Chen & Ming Hu & Jianfu Wang, 2022. "Food Delivery Service and Restaurant: Friend or Foe?," Management Science, INFORMS, vol. 68(9), pages 6539-6551, September.
    8. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    9. Nabila Azi & Michel Gendreau & Jean-Yves Potvin, 2012. "A dynamic vehicle routing problem with multiple delivery routes," Annals of Operations Research, Springer, vol. 199(1), pages 103-112, October.
    10. Long He & Ho-Yin Mak & Ying Rong & Zuo-Jun Max Shen, 2017. "Service Region Design for Urban Electric Vehicle Sharing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 19(2), pages 309-327, May.
    11. Terry A. Taylor, 2018. "On-Demand Service Platforms," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 704-720, October.
    12. Marlin W. Ulmer & Barrett W. Thomas & Dirk C. Mattfeld, 2019. "Preemptive depot returns for dynamic same-day delivery," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 327-361, December.
    13. Steven C. Salop, 1979. "Monopolistic Competition with Outside Goods," Bell Journal of Economics, The RAND Corporation, vol. 10(1), pages 141-156, Spring.
    14. Oded Berman & Richard C. Larson & Samuel S. Chiu, 1985. "Optimal Server Location on a Network Operating as an M / G /1 Queue," Operations Research, INFORMS, vol. 33(4), pages 746-771, August.
    15. Gérard P. Cachon, 2014. "Retail Store Density and the Cost of Greenhouse Gas Emissions," Management Science, INFORMS, vol. 60(8), pages 1907-1925, August.
    16. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    17. Mehdi H. Farahani & Milind Dawande & Ganesh Janakiraman, 2022. "Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees," Operations Research, INFORMS, vol. 70(4), pages 2013-2031, July.
    18. Eryn Juan He & Joel Goh, 2022. "Profit or Growth? Dynamic Order Allocation in a Hybrid Workforce," Management Science, INFORMS, vol. 68(8), pages 5891-5906, August.
    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. Zhou, Wenli & Liu, Huan & Cao, Ping & Wang, Yaolei, 2024. "Optimal pricing for on-demand service platforms with heterogeneous customer demand frequencies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 189(C).
    2. Liu, Minjian & Dong, Qi & Li, Yunbing & Du, Shaofu, 2026. "Navigating trade-offs in online food delivery: The interplay of buy-online-and-pick-up-in-store and delay insurance," International Journal of Production Economics, Elsevier, vol. 291(C).
    3. Xiaokai Wu & Li Jiang & Xuan Zhao, 2025. "Managing Quality on Two-Sided Platforms in the Presence of Provider Competition," Manufacturing & Service Operations Management, INFORMS, vol. 27(5), pages 1532-1550, September.
    4. Yongtong Chen & Haojie Zheng & Shuzhu Zhang, 2025. "Solving a Multi-Depot Battery Swapping Cabinet Location-Routing Problem with Time Windows via a Heuristic-Enhanced Branch-and-Price Algorithm," Mathematics, MDPI, vol. 13(20), pages 1-24, October.
    5. Taha Ameen & Flore Sentenac & Sophie H. Yu, 2026. "A uniformity principle for spatial matching," Papers 2601.13426, arXiv.org, revised Feb 2026.
    6. Lu Zhen & Jiajing Gao & Shuaian Wang & Gilbert Laporte & Xiaohang Yue, 2025. "Optimizing an On-Demand Delivery Mode Based on Trucks and Drones," Transportation Science, INFORMS, vol. 59(5), pages 1008-1031, September.
    7. He, Xueting & Zhen, Lu, 2025. "Column-and-row generation based exact algorithm for relay-based on-demand delivery systems," Transportation Research Part B: Methodological, Elsevier, vol. 196(C).
    8. Yotaro Takazawa & Koji Kuroda & Hotaka Hattori, 2026. "Mixed-Integer Programming Dispatch with Courier Drop-Out Risk: Balancing Cost and Delay in Hybrid Food Delivery Fleets," SN Operations Research Forum, Springer, vol. 7(2), pages 1-31, June.

    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. Junyu Cao & Wei Qi, 2023. "Stall Economy: The Value of Mobility in Retail on Wheels," Operations Research, INFORMS, vol. 71(2), pages 708-726, March.
    2. Jaelynn Oh & Chloe Kim Glaeser & Xuanming Su, 2026. "Food Ordering and Delivery: How Platforms and Restaurants Should Split the Pie," Management Science, INFORMS, vol. 72(3), pages 1748-1768, March.
    3. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    4. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    5. Natarajan Gautam & Joseph Geunes, 2024. "Analysis of Real-Time Order Fulfillment Policies: When to Dispatch a Batch?," Service Science, INFORMS, vol. 16(2), pages 85-106, June.
    6. 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.
    7. Banerjee, Dipayan & Erera, Alan L. & Stroh, Alexander M. & Toriello, Alejandro, 2023. "Who has access to e-commerce and when? Time-varying service regions in same-day delivery," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 148-168.
    8. Sheng Liu & Zhixing Luo, 2023. "On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 595-612, March.
    9. 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.
    10. 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.
    11. Zhao, Chen & Wang, Zhongbin, 2023. "The impact of line-sitting on a two-server queueing system," European Journal of Operational Research, Elsevier, vol. 308(2), pages 782-800.
    12. Wenzheng Mao & Liu Ming & Ying Rong & Christopher S. Tang & Huan Zheng, 2022. "On-Demand Meal Delivery Platforms: Operational Level Data and Research Opportunities," Manufacturing & Service Operations Management, INFORMS, vol. 24(5), pages 2535-2542, September.
    13. 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.
    14. Zhang, Yali & Ding, Zhenbin & Sun, Jun & Chen, Delin & Goh, Mark & Yang, Zhaojun, 2026. "Evolving last-mile logistics: Where unmanned delivery fits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 206(C).
    15. Soraya Fatehi & Michael R. Wagner, 2022. "Crowdsourcing Last-Mile Deliveries," Manufacturing & Service Operations Management, INFORMS, vol. 24(2), pages 791-809, March.
    16. 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.
    17. 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.
    18. Liron Ravner & Ran I. Snitkovsky, 2024. "Stochastic Approximation of Symmetric Nash Equilibria in Queueing Games," Operations Research, INFORMS, vol. 72(6), pages 2698-2725, November.
    19. John Gunnar Carlsson & Sheng Liu & Nooshin Salari & Han Yu, 2024. "Provably Good Region Partitioning for On-Time Last-Mile Delivery," Operations Research, INFORMS, vol. 72(1), pages 91-109, January.
    20. Niels Agatz & Soo-Haeng Cho & Hao Sun & Hai Wang, 2024. "Transportation-Enabled Services: Concept, Framework, and Research Opportunities," Service Science, INFORMS, vol. 16(1), pages 1-21, March.

    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:ormnsc:v:70:y:2024:i:6:p:3789-3807. 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.