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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agius, M., Absi, N., Feillet, D., & Garaix, T. (2022). A branch-and-price algorithm for a routing problem with inbound and outbound requests. Computers & Operations Research, 146, 105896.
Arslan, A. M., Agatz, N., & Klapp, M. A. (2021). Operational strategies for on-demand personal shopper services. Transportation Research Part C, 130, 103320.
Aziez, I., Côté, J. F., & Coelho, L. C. (2020). Exact algorithms for the multi-pickup and delivery problem with time windows. European Journal of Operational Research, 284(3), 906–919.
Chen, X., Wang, Y., Wang, Y., Qu, X., & Ma, X. (2021). Customized bus route design with pickup and delivery and time windows: Model, case study and comparative analysis. Expert Systems with Applications, 168, 114242.
Fikar, C. (2018). A decision support system to investigate food losses in e-grocery deliveries. Computers & Industrial Engineering, 117, 282–290.
Fikar, C., Mild, A., & Waitz, M. (2021). Facilitating consumer preferences and product shelf life data in the design of e-grocery deliveries. European Journal of Operational Research, 294(3), 976–986.
Guo, C., Thompson, R. G., Foliente, G., & Peng, X. (2021). Reinforcement learning enabled dynamic bidding strategy for instant delivery trading. Computers & Industrial Engineering, 160, 107596.
Klein, R., Neugebauer, M., Ratkovitch, D., & Steinhardt, C. (2019). Differentiated time slot pricing under routing considerations in attended home delivery. Transportation Science, 53(1), 236–255.
Kohar, A., & Jakhar, S. K. (2021). A capacitated multi pickup online food delivery problem with time windows: Abranch-and-cut algorithm. In press.
Liu, D., Yan, P., Pu, Z., Wang, Y., & Kaisar, E. I. (2021a). Hybrid artificial immune algorithm for optimizing a Van-Robot e-grocery delivery system. Transportation Research Part E, 154, 102466.
Liu, S., He, L., & Shen, Z.-J.M. (2021b). On-time last-mile delivery: Order assignment with travel-time predictors. Management Science, 67(7), 4095–4119.
Naccache, S., Côté, J. F., & Coelho, L. C. (2018). The multi-pickup and delivery problem with time windows. European Journal of Operational Research, 269(1), 353–362.
Reyes, D., Erera, A. L., & Savelsbergh, M. W. P. (2018). Complexity of routing problems with release dates and deadlines. European Journal of Operational Research, 266(1), 29–34.
Snoeck, A., & Winkenbach, M. (2021). A discrete simulation-based optimization algorithm for the design of highly responsive last-mile distribution networks. Transportation Science, 56(1), 201–222.
Ulmer, M. W., Mattfeld, D. C., & Koster, F. (2018). Budgeting time for dynamic vehicle routing with stochastic customer requests. Transportation Science, 52, 20–37.
Ulmer, M. W., Thomas, B. W., Campbell, A. M., & Woyak, N. (2021). The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transportation Science, 55(1), 75–100.
Ulrich, M., Jahnke, H., Langrock, R., Pesch, R., & Senge, R. (2021). Distributional regression for demand forecasting in e-grocery. European Journal of Operational Research, 294(3), 831–842.
Vaziri, S., Etebari, F., & Vahdani, B. (2019). Development and optimization of a horizontal carrier collaboration vehicle routing model with multi-commodity request allocation. Journal of Cleaner Production, 224, 492–505.
Voccia, S. A., Campbell, A. M., & Thomas, B. W. (2019). The same-day delivery problem for online purchases. Transportation Science, 53(1), 167–184.
Zhang, J., Liu, F., Tang, J., & Li, Y. (2019). The online integrated order picking and delivery considering pickers’ learning effects for an O2O community supermarket. Transportation Research Part E, 123, 180–199.
Zhen, L., He, X., Wang, H., Laporte, G., & Tan, Z. (2022). Decision models on personal shopper platform operations optimization. Transportation Research Part C, 142, 103782.
Zhen, L., & Li, H. (2022). A literature review of smart warehouse operations management. Frontiers of Engineering Management, 9(1), 31–55.
Zhuang, X., Zhang, Y., Nan, L., Jiang, J., Hu, L., & Wu, S. (2023). Two-stage stochastic programming with robust constraints for the logistics network post-disruption response strategy optimization. Frontiers of Engineering Management, 10(1), 67–81.
Acknowledgements
This research was supported by the National Natural Science Foundation of China (Grant numbers 72361137001, 72025103, 71831008 and 72172145) and the Beijing Natural Science Foundation (9212020).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix
Algorithm 1: An exact algorithm for solving the PP model \({\text{M}}_{\text{PP}}^{\text{Stage}2}\)
Appendix B
Algorithm 2: An exact algorithm for solving the PP model \({\text{M}1}_{PP }^{Equ}\)
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wu, J., Zhen, L., He, X. et al. Operations optimization for third-party e-grocery platforms. Ann Oper Res 332, 831–858 (2024). https://doi.org/10.1007/s10479-023-05634-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-023-05634-6