IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v332y2024i1d10.1007_s10479-023-05634-6.html
   My bibliography  Save this article

Operations optimization for third-party e-grocery platforms

Author

Listed:
  • Jingwen Wu

    (Shanghai University)

  • Lu Zhen

    (Shanghai University)

  • Xueting He

    (Shanghai University)

  • Xin Tian

    (University of Chinese Academy of Sciences
    Chinese Academy of Sciences)

Abstract

In the era of e-commerce, a new business mode—e-grocery platform has become popular in recent years. An e-grocery platform need not own and operate shops. The platform assigns the orders that customers release on the platform to the part-time couriers; then the couriers go to some nearby shops, buy the commodities required by orders, and deliver them to the orders’ shipping address. This study proposes a mathematical model on selecting and accepting customer orders, assigning the accepted orders to couriers, selecting shops for buying each order’s required commodities, and routing each courier among her/his visited shops and assigned order’s shipping address. Moreover, the uncertain arrivals of future orders is taken into account by the proposed model. For solving the proposed two-stage stochastic integer programming model with the integer recourse function, this study also designs a novel algorithm based on column generation. Based on the real data from platform operators in Shanghai and Hangzhou, numerical experiments are conducted to validate the efficiency of the proposed algorithm. Sensitivity analysis based on the real data are also conducted to derive potentially useful managerial implications for practitioners who operate third-party e-grocery platforms.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:annopr:v:332:y:2024:i:1:d:10.1007_s10479-023-05634-6
    DOI: 10.1007/s10479-023-05634-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05634-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-023-05634-6?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Reyes, Damián & Erera, Alan L. & Savelsbergh, Martin W.P., 2018. "Complexity of routing problems with release dates and deadlines," European Journal of Operational Research, Elsevier, vol. 266(1), pages 29-34.
    2. 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.
    3. 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.
    4. Robert Klein & Michael Neugebauer & Dimitri Ratkovitch & Claudius Steinhardt, 2019. "Differentiated Time Slot Pricing Under Routing Considerations in Attended Home Delivery," Service Science, INFORMS, vol. 53(1), pages 236-255, February.
    5. 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.
    6. Ulrich, Matthias & Jahnke, Hermann & Langrock, Roland & Pesch, Robert & Senge, Robin, 2021. "Distributional regression for demand forecasting in e-grocery," European Journal of Operational Research, Elsevier, vol. 294(3), pages 831-842.
    7. 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.
    8. Liu, Dan & Yan, Pengyu & Pu, Ziyuan & Wang, Yinhai & Kaisar, Evangelos I., 2021. "Hybrid artificial immune algorithm for optimizing a Van-Robot E-grocery delivery system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    9. 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.
    10. Fikar, Christian & Mild, Andreas & Waitz, Martin, 2021. "Facilitating consumer preferences and product shelf life data in the design of e-grocery deliveries," European Journal of Operational Research, Elsevier, vol. 294(3), pages 976-986.
    11. Zhang, Jun & Liu, Feng & Tang, Jiafu & Li, Yanhui, 2019. "The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 180-199.
    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. 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).
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Haider, Zulqarnain & Hu, Yujie & Charkhgard, Hadi & Himmelgreen, David & Kwon, Changhyun, 2022. "Creating grocery delivery hubs for food deserts at local convenience stores via spatial and temporal consolidation," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    7. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    8. Koch, Sebastian & Klein, Robert, 2020. "Route-based approximate dynamic programming for dynamic pricing in attended home delivery," European Journal of Operational Research, Elsevier, vol. 287(2), pages 633-652.
    9. 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.
    10. Bosse, Alexander & Ulmer, Marlin W. & Manni, Emanuele & Mattfeld, Dirk C., 2023. "Dynamic priority rules for combining on-demand passenger transportation and transportation of goods," European Journal of Operational Research, Elsevier, vol. 309(1), pages 399-408.
    11. Ye, Anke & Zhang, Kenan & Chen, Xiqun (Michael) & Bell, Michael G.H. & Lee, Der-Horng & Hu, Simon, 2024. "Modeling and managing an on-demand meal delivery system with order bundling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    12. 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).
    13. Waßmuth, Katrin & Köhler, Charlotte & Agatz, Niels & Fleischmann, Moritz, 2023. "Demand management for attended home delivery—A literature review," European Journal of Operational Research, Elsevier, vol. 311(3), pages 801-815.
    14. Kohar, Amit & Jakhar, Suresh Kumar & Agarwal, Yogesh K., 2023. "Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 176(C).
    15. Auad, Ramon & Erera, Alan & Savelsbergh, Martin, 2023. "Courier satisfaction in rapid delivery systems using dynamic operating regions," Omega, Elsevier, vol. 121(C).
    16. A. Mor & M. G. Speranza, 2022. "Vehicle routing problems over time: a survey," Annals of Operations Research, Springer, vol. 314(1), pages 255-275, July.
    17. Qin Song, 2023. "Semi-Open Multi-Distribution Center Path Planning with Time Windows," Sustainability, MDPI, vol. 15(6), pages 1-14, March.
    18. 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.
    19. Avraham, Edison & Raviv, Tal, 2021. "The steady-state mobile personnel booking problem," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 266-288.
    20. 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.

    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:spr:annopr:v:332:y:2024:i:1:d:10.1007_s10479-023-05634-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.