Winning the race to customers with micro-fulfillment centers: an approach for network planning in quick commerce

Author:

Yang Xuefei,Ostermeier Manuel,Hübner AlexanderORCID

Abstract

AbstractIn 2020, the first quick commerce businesses in grocery retail emerged in the European market. Customers can order online and receive their groceries within 15 min in the best case. The ability to provide short lead times is, therefore, essential. However, the ambitious service promises of quick deliveries further complicate order fulfillment, and many retailers are struggling to achieve profitability. Quick commerce retailers need to establish an efficient network of micro-fulfillment centers (MFCs) in customer proximity, i.e., urban areas, to master these challenges. We address this strategic network problem and formulate it as a location routing problem. This enables us to define the number, location, type, and size of MFCs based on setup, replenishment, order processing, and transportation costs. We solve the problem using a cluster-first-route-second heuristic based on agglomerative clustering to approximate transportation costs. Our numerical experiments show that our heuristic solves the problem effectively and provides efficient decision support for quick commerce retailing. We generate managerial insights by analyzing key aspects of a quick commerce business, such as lead times and problem-specific cost factors. We show, for example, that allowing slightly higher delivery flexibility (e.g., offering extended lead times) enables bundling effects and results in cost savings of 50% or more of fulfillment costs. Furthermore, using multiple small MFCs is more efficient than larger, automated MFCs from a lead time and cost perspective.

Funder

Technische Universität München

Publisher

Springer Science and Business Media LLC

Reference85 articles.

1. Acimovic J, Graves SC (2015) Making better fulfillment decisions on the fly in an online retail environment. Manuf Serv Oper Manag 17(1):34–51

2. Agatz NAH, Fleischmann M, van Nunen JAEE (2008) E-fulfillment and multi-channel distribution-a review. Eur J Oper Res 187(2):339–356

3. Aksen D, Altinkemer K (2008) A location-routing problem for the conversion to the “click-and-mortar’’ retailing: the static case. Eur J Oper Res 186(2):554–575

4. Applegate DL, Bixby RE, Chvátal V, Cook WJ (2011) The traveling salesman problem. In: The traveling salesman problem-a computational study, Princeton university press, Princeton

5. Ariker CT (2021) Do consumers punish retailers with poor working conditions during covid-19 crisis? an experimental study of q-commerce grocery retailers. J Manag Market Logist 8(3):140–153

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3