IDEAS home Printed from https://ideas.repec.org/p/mag/wpaper/22007.html

Consistent Routing for Local Same-Day Delivery via Micro-Hubs

Author

Listed:
  • Charlotte Ackva
  • Marlin W. Ulmer

Abstract

An increasing number of local shops offer local same-day delivery to compete with the online giants. However, the distribution of parcels from individual shops to customers reduces the rare consolidation opportunities in the last mile even further. Thus, shops start collaborating on urban same-day delivery by using shared vehicles for consolidated transportation of parcels. The shared vehicles conduct consistent daily routes between micro-hubs in the city, serving as transshipment and consolidation centres. This allows stores to bring orders to the next micro-hub, where the parcel is picked up by a vehicle and delivered to the microhub closest to its destination – if it is feasible with respect to the vehicle’s consistent daily schedule. Creating effective schedules is therefore very important. The difficulty of finding an effective consistent route is amplified by the daily uncertainty in order placements. We model the problem as a two-stage stochastic program. The first stage determines the vehicle schedules. The second stage optimises the flow of realized orders. The goal is to satisfy as many orders per day as possible with the shared vehicles. We propose a multiple scenario approach and suggest problem-specific consensus functions for this framework. We assess the method’s performance against an upper bound, a practically-inspired heuristic, and the original consensus function. Our approach clearly outperforms the practically-inspired heuristic and the original consensus function. We observe that collaborative delivery via micro-hubs is worthwhile for delivery time promises of two hours or more. Noticeably, for these service promises, the cost of consistency are surprisingly low.

Suggested Citation

  • Charlotte Ackva & Marlin W. Ulmer, 2022. "Consistent Routing for Local Same-Day Delivery via Micro-Hubs," FEMM Working Papers 22007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
  • Handle: RePEc:mag:wpaper:22007
    as

    Download full text from publisher

    File URL: https://www.fww.ovgu.de/fww_media/femm/femm_2022/2022_07.pdf
    File Function: First version, 2011
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "A survey on dynamic and stochastic vehicle routing problems," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 215-231, January.
    2. Gianpaolo Ghiani & Emanuele Manni & Barrett W. Thomas, 2012. "A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem," Transportation Science, INFORMS, vol. 46(3), pages 374-387, August.
    3. Salavati-Khoshghalb, Majid & Gendreau, Michel & Jabali, Ola & Rei, Walter, 2019. "An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy," European Journal of Operational Research, Elsevier, vol. 273(1), pages 175-189.
    4. Visser, T.R. & Savelsbergh, M.W.P., 2019. "Strategic Time Slot Management: A Priori Routing for Online Grocery Retailing," Econometric Institute Research Papers EI2019-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    5. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, December.
    6. Dapei Jiang & Xiangyong Li, 2021. "Order fulfilment problem with time windows and synchronisation arising in the online retailing," International Journal of Production Research, Taylor & Francis Journals, vol. 59(4), pages 1187-1215, 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. Shohre Zehtabian & Marlin W. Ulmer, 2023. "Consistent Time Window Assignments for Stochastic Multi-Depot Multi-Commodity Pickup and Delivery," FEMM Working Papers 23002, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.

    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. Charlotte Ackva & Marlin W. Ulmer, 2024. "Consistent routing for local same-day delivery via micro-hubs," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(2), pages 375-409, June.
    2. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    3. Ninja Soeffker & Marlin W. Ulmer & Dirk C. Mattfeld, 2024. "Balancing resources for dynamic vehicle routing with stochastic customer requests," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(2), pages 331-373, June.
    4. Marlin W. Ulmer & Leonard Heilig & Stefan Voß, 2017. "On the Value and Challenge of Real-Time Information in Dynamic Dispatching of Service Vehicles," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 59(3), pages 161-171, June.
    5. Yu Wu & Bo Zeng & Siming Huang, 2019. "A Dynamic Strategy for Home Pick-Up Service with Uncertain Customer Requests and Its Implementation," Sustainability, MDPI, vol. 11(7), pages 1-21, April.
    6. 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.
    7. Yuanyuan Li & Claudia Archetti & Ivana Ljubić, 2024. "Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates," Transportation Science, INFORMS, vol. 58(5), pages 1143-1165, September.
    8. 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.
    9. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
    10. 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.
    11. Liu, Chuanju & Lin, Shaochong & Shen, Zuo-Jun Max & Zhang, Junlong, 2023. "Stochastic service network design: The value of fixed routes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    12. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Koh, Jimmy, 2024. "Dynamic tugboat deployment and scheduling with stochastic and time-varying service demands," Transportation Research Part B: Methodological, Elsevier, vol. 188(C).
    13. 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.
    14. Srour, F.J. & Agatz, N.A.H. & Oppen, J., 2014. "Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows," ERIM Report Series Research in Management ERS-2014-015-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    15. Srour, F.J. & Agatz, N.A.H. & Oppen, J., 2014. "The Value of Inaccurate Advance Time Window Information in a Pick-up and Delivery Problem," ERIM Report Series Research in Management ERS-2014-002-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Ulmer, Marlin W. & Soeffker, Ninja & Mattfeld, Dirk C., 2018. "Value function approximation for dynamic multi-period vehicle routing," European Journal of Operational Research, Elsevier, vol. 269(3), pages 883-899.
    17. Yu Wu & Bo Zeng & Ming Jian, 2025. "ADP- and rollout-based dynamic vehicle routing for pick-up service via budgeting capacity," Flexible Services and Manufacturing Journal, Springer, vol. 37(2), pages 513-557, June.
    18. 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).
    19. Zhaoxia Guo & Stein W. Wallace & Michal Kaut, 2019. "Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 654-670, October.
    20. Leon Lan & Jasper M. H. van Doorn & Niels A. Wouda & Arpan Rijal & Sandjai Bhulai, 2024. "An Iterative Sample Scenario Approach for the Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 58(4), pages 726-740, July.

    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:mag:wpaper:22007. 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: IT Administrators at FWW (email available below). General contact details of provider: https://edirc.repec.org/data/fwmagde.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.