IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v52y2022i2p133-148.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Ningxuan Kang & Hao Shen & Ye Xu, 2022. "JD.com Improves Delivery Networks by a Multiperiod Facility Location Model," Interfaces, INFORMS, vol. 52(2), pages 133-148, March.
    • Handle: RePEc:inm:orinte:v:52:y:2022:i:2:p:133-148
    DOI: 10.1287/inte.2021.1077
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2021.1077
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2021.1077?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. Jordi Castro & Stefano Nasini & Francisco Saldanha-Da-Gama, 2017. "A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method," Post-Print hal-01745324, HAL.
    2. George O. Wesolowsky & William G. Truscott, 1975. "The Multiperiod Location-Allocation Problem with Relocation of Facilities," Management Science, INFORMS, vol. 22(1), pages 57-65, September.
    3. Pieter L. van den Berg & Guido A. G. Legemaate & Rob D. van der Mei, 2017. "Increasing the Responsiveness of Firefighter Services by Relocating Base Stations in Amsterdam," Interfaces, INFORMS, vol. 47(4), pages 352-361, August.
    4. T. L. Magnanti & R. T. Wong, 1981. "Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria," Operations Research, INFORMS, vol. 29(3), pages 464-484, June.
    5. Christofides, N. & Beasley, J. E., 1983. "Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem," European Journal of Operational Research, Elsevier, vol. 12(1), pages 19-28, January.
    6. J. David Allen & Roger L. Tobin & Anthony Calderan, 2017. "Verizon Optimizes Work Center Locations to Reduce Installation and Repair Operations Costs," Interfaces, INFORMS, vol. 47(2), pages 111-121, April.
    7. Siyang Xie & Xi Chen & Zhaodong Wang & Yanfeng Ouyang & Kamalesh Somani & Jing Huang, 2016. "Integrated Planning for Multiple Types of Locomotive Work Facilities Under Location, Routing, and Inventory Considerations," Interfaces, INFORMS, vol. 46(5), pages 391-408, October.
    8. Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron, 2017. "Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 388-404, August.
    9. Serhan Duran & Marco A. Gutierrez & Pinar Keskinocak, 2011. "Pre-Positioning of Emergency Items for CARE International," Interfaces, INFORMS, vol. 41(3), pages 223-237, June.
    10. Pablo Santibáñez & Georgia Bekiou & Kenneth Yip, 2009. "Fraser Health Uses Mathematical Programming to Plan Its Inpatient Hospital Network," Interfaces, INFORMS, vol. 39(3), pages 196-208, June.
    11. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    12. Jacobsen, Soren Kruse, 1983. "Heuristics for the capacitated plant location model," European Journal of Operational Research, Elsevier, vol. 12(3), pages 253-261, March.
    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. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    3. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    4. Corberán, Ángel & Landete, Mercedes & Peiró, Juanjo & Saldanha-da-Gama, Francisco, 2020. "The facility location problem with capacity transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    5. Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron, 2015. "Dynamic Facility Location with Generalized Modular Capacities," Transportation Science, INFORMS, vol. 49(3), pages 484-499, August.
    6. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    7. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Pearce, Robin H. & Forbes, Michael, 2018. "Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 78-88.
    9. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Bhuiyan, Tanveer Hossain & Medal, Hugh R. & Harun, Sarah, 2020. "A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption," European Journal of Operational Research, Elsevier, vol. 285(2), pages 670-694.
    11. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    12. Allman, Andrew & Zhang, Qi, 2020. "Dynamic location of modular manufacturing facilities with relocation of individual modules," European Journal of Operational Research, Elsevier, vol. 286(2), pages 494-507.
    13. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    14. Sanci, Ece & Daskin, Mark S., 2019. "Integrating location and network restoration decisions in relief networks under uncertainty," European Journal of Operational Research, Elsevier, vol. 279(2), pages 335-350.
    15. Dufour, Émilie & Laporte, Gilbert & Paquette, Julie & Rancourt, Marie–Ève, 2018. "Logistics service network design for humanitarian response in East Africa," Omega, Elsevier, vol. 74(C), pages 1-14.
    16. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    17. Lee, Chungmok & Han, Jinil, 2017. "Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 130-152.
    18. M. Jenabi & S. M. T. Fatemi Ghomi & S. A. Torabi & Moeen Sammak Jalali, 2022. "An accelerated Benders decomposition algorithm for stochastic power system expansion planning using sample average approximation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1304-1336, December.
    19. Jingxian Chen & Liang Liang & Dong-Qing Yao, 2017. "Pre-positioning of relief inventories for non-profit organizations: a newsvendor approach," Annals of Operations Research, Springer, vol. 259(1), pages 35-63, December.
    20. Chao Li & Muhong Zhang & Kory Hedman, 2021. "Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1037-1055, July.

    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:orinte:v:52:y:2022:i:2:p:133-148. 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.