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

References

• Aardal K (1998) Capacitated facility location: Separation algorithm and computational experience. Math. Programming 81:149–175.Google Scholar
• Aktaş E, Özaydin Ö, Bozkaya B, Ülengin F, Önsel Ş (2013) Optimizing fire station locations for the Istanbul Metropolitan Municipality. Interfaces 43(3):240–255.Link, Google Scholar
• Allen JD, Tobin RL, Calderan A (2017) Verizon optimizes work center locations to reduce installation and repair operations costs. Interfaces 47(2):111–121.Link, Google Scholar
• Arabani AB, Farahani RZ (2012) Facility location dynamics: An overview of classifications and applications. Comput. Indust. Engrg. 62(1):408–420.Google Scholar
• Canel C, Khumawala BM (1997) Multi-period international facilities location: An algorithm and application. Internat. J. Production Res. 35(7):1891–1910.Google Scholar
• Castro J, Nasini S, Saldanhadagama F (2017) A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math. Programming 163(1):411–444.Google Scholar
• Chardaire P, Sutter A, Costa M (1996) Solving the dynamic facility location problem. Networks 28(2):117–124.Google Scholar
• Christofides N, Beasley JE (1983) Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem. Eur. J. Oper. Res. 12(1):19–28.Google Scholar
• Daskin MS (2013) Network and Discrete Location: Models, Algorithms, and Applications, 2nd ed. (Wiley, Hoboken, NJ).Google Scholar
• Dias J, Captivo ME, Clímaco J (2007) Efficient primal-dual heuristic for a dynamic location problem. Comput. Oper. Res. 34(6):1800–1823.Google Scholar
• Duran S, Gutierrez MA, Keskinocak P (2011) Pre-positioning of emergency items for CARE International. Interfaces 41(3):223–237.Link, Google Scholar
• Guignard M, Spielberg K (1979) A direct dual method for the mixed plant location problem with some side constraints. Math. Programming 17(1):198–228.Google Scholar
• Ho SC (2015) An iterated tabu search heuristic for the single source capacitated facility location problem. Appl. Soft Comput. 27:169–178.Google Scholar
• Jacobsen SK (1983) Heuristics for the capacitated plant location model. European J. Oper. Res. 12(3):253–261.Google Scholar
• Jena SD, Cordeau JF, Gendron B (2017) Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities. INFORMS J. Comput. 29(3):388–404.Link, Google Scholar
• Klose A, Görtz S (2007) A branch-and-price algorithm for the capacitated facility location problem. Eur. J. Oper. Res. 179(3):1109–1125.Google Scholar
• Köksalan M, Süral H (1999) Efes Beverage Group makes location and distribution decisions for its malt plants. Interfaces 29(2):89–103.Link, Google Scholar
• Magnanti TL, Wong RT (1981) Accelerating benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
• Melkote S, Daskin MS (2001) Capacitated facility location/network design problems. Eur. J. Oper. Res. 129(3):481–495.Google Scholar
• Nickel S, Saldanha da Gama F (2015) Multi-period facility location. Laporte G, Nickel S, Saldanha da Gamma F, eds. Location Science (Springer, Boston), 289–210.Google Scholar
• Santibáñez P, Bekiou G, Yip K (2009) Fraser Health uses mathematical programming to plan its inpatient hospital network. Interfaces 39(3):196–208.Link, Google Scholar
• Tran TH, Scaparra MP, O’Hanley JR (2017) A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem. Eur. J. Oper. Res. 263(1):173–187.Google Scholar
• van den Berg PL, Legemaate GAG, van der Mei RD (2017) Increasing the responsiveness of firefighter services by relocating base stations in Amsterdam. Interfaces 47(4):352–361.Link, Google Scholar
• Wesolowsky GO, Truscott WG (1975) The multiperiod location-allocation problem with relocation of facilities. Management Sci. 22(1):57–65.Link, Google Scholar
• Xie S, Chen X, Wang Z, Ouyang Y, Somani K, Huang J (2016) Integrated planning for multiple types of locomotive work facilities under location, routing, and inventory considerations. Interfaces 46(5):391–408.Link, Google Scholar