JD.com Improves Delivery Networks by a Multiperiod Facility Location Model

Ningxuan Kang (), Hao Shen () and Ye Xu ()
Additional contact information
Ningxuan Kang: JD.com, Beijing 100101, China
Hao Shen: School of Business, Renmin University of China, Beijing 100872, China
Ye Xu: Bianlifeng, Beijing 100028, China

Interfaces, 2022, vol. 52, issue 2, 133-148

Abstract: Because delivery systems play an increasingly significant role in modern life, it is of strategical importance to design an efficient and adaptive delivery network. JD.com is the largest business-to-consumer e-commerce company by revenue in China and has built the largest amount of logistics infrastructure nationwide. In this study, we developed an optimization model to automatically make annual plans of the delivery stations that minimize operational costs. We built an optimization algorithm by adopting a multiperiod facility location model a using mixed-integer linear programming (MILP) method and proposing applicable techniques to solve the model. The results demonstrate that our model generates improved plans compared with manually planning in terms of both operational cost and delivery distance. The tool described in this paper helps JD.com save on delivery costs and gain operational benefits in designing delivery networks.

Keywords: dynamic facility location problem; delivery networks; mixed-integer linear programming (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.2021.1077 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:52:y:2022:i:2:p:133-148

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().