IDEAS home Printed from https://ideas.repec.org/a/inm/orserv/v15y2023i1p41-57.html

Personal Shopper Systems in Last-Mile Logistics

Author

Listed:
  • Jelmer Pier van der Gaast

    (Department of Management Science, Fudan University, Shanghai 200437, China)

  • Alp Muzaffer Arslan

    (Department of Management Science, Lancaster University, Lancaster LA1 4YX, United Kingdom)

Abstract

This paper explores the logistics operations of instant grocery delivery services. Therefore, we introduce the instant delivery problem ( IDP ) to replicate and examine two widely adopted strategies in the rapid delivery market: the personal shopper system (PSS) and the inventory owned delivery (IOD) system. In the PSS, couriers visit affiliated brick-and-mortar stores in the delivery area to pick up and purchase ordered products and then deliver them to customers. In the IOD system, couriers collect products from a single distribution center, or so-called dark store, in which the platform manages the inventory. Even though a PSS strategy is asset light because of the utilization of existing retailers in the area, maintaining a good level of on-time instant deliveries with the PSS is more complex than with IOD. This is because the PSS requires deciding which store to purchase ordered goods from, and picking and shopping at stores needs to be considered in the real-time decision process. We propose a tailored rolling horizon framework that utilizes column generation to browse updated delivery plans for arriving customer orders. Computational studies both in real life–inspired settings and in case studies on selected urban areas show that the PSS is a highly competitive strategy compared with IOD, particularly when dealing with small-sized customer orders. We observe that the performance of the PSS is robust when varying the delivery service time frame. The case studies also suggest that the PSS becomes even more competitive in areas where the retail store density is high.

Suggested Citation

  • Jelmer Pier van der Gaast & Alp Muzaffer Arslan, 2023. "Personal Shopper Systems in Last-Mile Logistics," Service Science, INFORMS, vol. 15(1), pages 41-57, March.
  • Handle: RePEc:inm:orserv:v:15:y:2023:i:1:p:41-57
    DOI: 10.1287/serv.2022.0310
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/serv.2022.0310
    Download Restriction: no

    File URL: https://libkey.io/10.1287/serv.2022.0310?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. Dimitris Bertsimas & Patrick Jaillet, & Sébastien Martin, 2019. "Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications," Operations Research, INFORMS, vol. 67(1), pages 143-162, January.
    2. Behrend, Moritz & Meisel, Frank, 2018. "The integration of item-sharing and crowdshipping: Can collaborative consumption be pushed by delivering through the crowd?," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 227-243.
    3. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    4. 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.
    5. Harish Guda & Upender Subramanian, 2019. "Your Uber Is Arriving: Managing On-Demand Workers Through Surge Pricing, Forecast Communication, and Worker Incentives," Management Science, INFORMS, vol. 67(5), pages 1995-2014, May.
    6. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    7. 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.
    8. 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.
    9. Wang, Hai & Yang, Hai, 2019. "Ridesourcing systems: A framework and review," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 122-155.
    10. Saif Benjaafar & Shining Wu & Hanlin Liu & Einar Bjarki Gunnarsson, 2022. "Dimensioning On-Demand Vehicle Sharing Systems," Management Science, INFORMS, vol. 68(2), pages 1218-1232, February.
    11. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    12. Terry A. Taylor, 2018. "On-Demand Service Platforms," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 704-720, October.
    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. Michiel A. J. uit het Broek & Albert H. Schrotenboer & Bolor Jargalsaikhan & Kees Jan Roodbergen & Leandro C. Coelho, 2021. "Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm," Operations Research, INFORMS, vol. 69(2), pages 380-409, March.
    15. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2020. "Exact algorithms for the multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 284(3), pages 906-919.
    16. 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.
    17. Martin Savelsbergh & Tom Van Woensel, 2016. "50th Anniversary Invited Article—City Logistics: Challenges and Opportunities," Transportation Science, INFORMS, vol. 50(2), pages 579-590, May.
    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. 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).
    3. Nils Boysen & Stefan Fedtke & Stefan Schwerdfeger, 2021. "Last-mile delivery concepts: a survey from an operational research perspective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 1-58, March.
    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. Auad, Ramon & Erera, Alan & Savelsbergh, Martin, 2023. "Courier satisfaction in rapid delivery systems using dynamic operating regions," Omega, Elsevier, vol. 121(C).
    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. Neves-Moreira, Fábio & Amorim, Pedro, 2024. "Learning efficient in-store picking strategies to reduce customer encounters in omnichannel retail," International Journal of Production Economics, Elsevier, vol. 267(C).
    8. Shachaf Ben-Gal & Michal Tzur, 2025. "Data-Driven Policies for the Online Ride-Hailing Problem with Fairness," Transportation Science, INFORMS, vol. 59(3), pages 647-669, June.
    9. 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.
    10. 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.
    11. André Snoeck & Matthias Winkenbach, 2022. "A Discrete Simulation-Based Optimization Algorithm for the Design of Highly Responsive Last-Mile Distribution Networks," Transportation Science, INFORMS, vol. 56(1), pages 201-222, January.
    12. Ilan Lobel & Sébastien Martin, 2025. "Detours in Shared Rides," Management Science, INFORMS, vol. 71(2), pages 1716-1736, February.
    13. 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).
    14. 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.
    15. Yang Liu & Sen Li, 2025. "Piggyback on Idle Ride-Sourcing Drivers for Integrated On-Demand and Flexible Intracity Parcel Delivery Services," Transportation Science, INFORMS, vol. 59(3), pages 494-517, June.
    16. Ji, Yuxiong & Zhou, Minhang & Zheng, Yujing & Shen, Yu & Du, Yuchuan, 2024. "Urban passenger-and-package sharing transportation by e-hailing taxis: A simulation-based pricing analysis in shanghai," Transport Policy, Elsevier, vol. 156(C), pages 138-151.
    17. Dong, Tingting & Xu, Zhengtian & Luo, Qi & Yin, Yafeng & Wang, Jian & Ye, Jieping, 2021. "Optimal contract design for ride-sourcing services under dual sourcing," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 289-313.
    18. 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.
    19. 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.
    20. Jorge, Diana & Rocha, Tomás & Ramos, Tânia Rodrigues Pereira, 2024. "A time-driven simulation–optimization framework for the dynamic heterogeneous order-courier assignment problem for instant deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).

    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:orserv:v:15:y:2023:i:1:p:41-57. 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.