Dynamic Facility Location Under Cumulative Customer Demand

Published Online:https://doi.org/10.1287/trsc.2025.0104

References

  • Alizadeh R, Nishi T, Bagherinejad J, Bashiri M (2021) Multi-period maximal covering location problem with capacitated facilities and modules for natural disaster relief services. Appl. Sci. 11(1):397.CrossrefGoogle Scholar
  • Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Sci. 41(3):382–391.LinkGoogle Scholar
  • Ballou RH (1968) Dynamic warehouse location analysis. J. Marketing Res. 5(3):271–276.CrossrefGoogle Scholar
  • Baron O, Milner J, Naseraldin H (2011) Facility location: A robust optimization approach. Production Oper. Management 20(5):772–785.CrossrefGoogle Scholar
  • Basciftci B, Ahmed S, Shen S (2021) Distributionally robust facility location problem under decision-dependent stochastic demand. Eur. J. Oper. Res. 292(2):548–561.CrossrefGoogle Scholar
  • Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.CrossrefGoogle Scholar
  • Berbeglia G, Garassino A, Vulcano G (2022) A comparative empirical study of discrete choice models in retail operations. Management Sci. 68(6):4005–4023.LinkGoogle Scholar
  • Bierlaire M (1998) Discrete choice models. Labbé M, Laporte G, Tanczos K, Toint P, eds. Operations Research and Decision Aid Methodologies in Traffic and Transportation Management (Springer, Berlin), 203–227.CrossrefGoogle Scholar
  • Büsing C, Comis M, Schmidt E, Streicher M (2021) Robust strategic planning for mobile medical units with steerable and unsteerable demands. Eur. J. Oper. Res. 295(1):34–50.CrossrefGoogle Scholar
  • Cánovas L, García S, Labbé M, Marín A (2007) A strengthened formulation for the simple plant location problem with order. Oper. Res. Let. 35(2):141–150.CrossrefGoogle Scholar
  • Clothiers M (2024) Tour schedule. Accessed April 30, 2024, https://www.maxwellsclothiers.com/tour-schedule.Google Scholar
  • Cordeau JF, Furini F, Ljubić I (2019) Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275(3):882–896.CrossrefGoogle Scholar
  • Cornuéjols G, Nemhauser GL, Wolsey LA (1991) The uncapacitated facility location problem. Michandani PB, Francis RL, eds. Discrete Location Theory (John Wiley and Sons, New York), 119–171.Google Scholar
  • Daneshvar M, Jena SD, Rei W (2023) A two-stage stochastic post-disaster humanitarian supply chain network design problem. Comput. Indust. Engrg. 183:109459.CrossrefGoogle Scholar
  • Dubinski K (2021) This mobile medical clinic has helped over 500 people in London, Ont. Accessed April 30, 2024, https://www.cbc.ca/news/canada/london/this-mobile-medical-clinic-has-helped-over-500-people-in-london-ont-1.6112957.Google Scholar
  • Farias VF, Jagabathula S, Shah D (2013) A nonparametric approach to modeling choice with limited data. Management Sci. 59(2):305–322.LinkGoogle Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York).Google Scholar
  • Gunawardane G (1982) Dynamic versions of set covering type public facility location problems. Eur. J. Oper. Res. 10(2):190–195.CrossrefGoogle Scholar
  • Hanjoul P, Peeters D (1987) A facility location problem with clients’ preference orderings. Regional Sci. Urban Econom. 17(3):451–473.CrossrefGoogle Scholar
  • Hazan E, Safra S, Schwartz O (2006) On the complexity of approximating k-set packing. Comput. Complexity 15(1):20–39.CrossrefGoogle Scholar
  • Hu H, Tang J, Tian T (2025) Robust facility location and protection under facility disruptions with decision-dependent uncertainty. Internat. J. Production Econom. 282:109558.CrossrefGoogle Scholar
  • Jena SD, Cordeau JF, Gendron B (2015) Dynamic facility location with generalized modular capacities. Transportation Sci. 49(3):484–499.LinkGoogle Scholar
  • Jena SD, Lodi A, Palmer H, Sole C (2020) A partially ranked choice model for large-scale data-driven assortment optimization. INFORMS J. Optim. 2(4):297–319.LinkGoogle Scholar
  • Karp RM (1972) Reducibility among combinatorial problems. Miller RE, Thatcher JW, Bohlinger JD, eds. Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and Sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department (Springer, New York), 85–103.CrossrefGoogle Scholar
  • Lamontagne S, Carvalho M, Frejinger E, Gendron B, Anjos MF, Atallah R (2023) Optimising electric vehicle charging station placement using advanced discrete choice models. INFORMS J. Comput. 35(5):1195–1213.LinkGoogle Scholar
  • Laporte G, Nickel S, Saldanha da Gama F (2019) Location Science (Springer, Cham, Switzerland).CrossrefGoogle Scholar
  • Lin YH, Tian Q, Zhao Y (2022) Locating facilities under competition and market expansion: Formulation, optimization, and implications. Production Oper. Management 31(7):3021–3042.CrossrefGoogle Scholar
  • Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.LinkGoogle Scholar
  • Malladi V, Muthuraman K (2024) Facility location problem: Modeling joint disruptions using subordination. Transportation Sci. 58(5):1016–1032.LinkGoogle Scholar
  • Marín A, Martínez-Merino LI, Rodríguez-Chía AM, Saldanha-da-Gama F (2018) Multi-period stochastic covering location problems: Modeling framework and solution approach. Eur. J. Oper. Res. 268(2):432–449.CrossrefGoogle Scholar
  • Nica F, Moraru M (2020) Diaspora policies, consular services and social protection for Romanian citizens abroad. Lafleur JM, Vintila D, eds. Migration and Social Protection in Europe and Beyond (Volume 2): Comparing Consular Services and Diaspora Policies (Springer, Cham, Switzerland), 409–425.CrossrefGoogle Scholar
  • Nickel S, Saldanha-da-Gama F (2019) Multi-period facility location. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer, Cham, Switzerland), 303–326.CrossrefGoogle Scholar
  • Nzioka T (2024) Kenya rolls out phase three of diaspora mobile consular services. Accessed April 30, 2024, https://www.the-star.co.ke/news/realtime/2024-03-18-kenya-rolls-out-phase-three-of-diaspora-mobile-consular-services/.Google Scholar
  • Qi M, Jiang R, Shen S (2024) Sequential competitive facility location: Exact and approximate algorithms. Oper. Res. 72(1):300–316.LinkGoogle Scholar
  • Qi M, Cheng C, Wang X, Rao W (2017) Mobile facility routing problem with service-time-related demand. 2017 Internat. Conf. Service Systems Service Management (IEEE, Dalian, China), 1–6.Google Scholar
  • Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.CrossrefGoogle Scholar
  • Rosenbaum MS, Edwards K, Ramirez GC (2021) The benefits and pitfalls of contemporary pop-up shops. Bus. Horizons 64(1):93–106.CrossrefGoogle Scholar
  • Sahyouni K, Savaskan RC, Daskin MS (2007) A facility location model for bidirectional flows. Transportation Sci. 41(4):484–499.LinkGoogle Scholar
  • Sweeney DJ, Tatham RL (1976) An improved long-run model for multiple warehouse location. Management Sci. 22(7):748–758.LinkGoogle Scholar
  • Van Roy TJ, Erlenkotter D (1982) A dual-based procedure for dynamic facility location. Management Sci. 28(10):1091–1105.LinkGoogle Scholar
  • van Ryzin G, Vulcano G (2015) A market discovery algorithm to estimate a general class of nonparametric choice models. Management Sci. 61(2):281–300.LinkGoogle Scholar
  • Vatsa AK, Jayaswal S (2021) Capacitated multi-period maximal covering location problem with server uncertainty. Eur. J. Oper. Res. 289(3):1107–1126.CrossrefGoogle Scholar
  • Wesolowsky GO (1973) Dynamic facility location. Management Sci. 19(11):1241–1248.LinkGoogle Scholar
  • Wesolowsky GO, Truscott WG (1975) The multiperiod location-allocation problem with relocation of facilities. Management Sci. 22(1):57–65.LinkGoogle Scholar
  • Zhang Z, Luo Z, Baldacci R, Lim A (2021) A Benders decomposition approach for the multivehicle production routing problem with order-up-to-level policy. Transportation Sci. 55(1):160–178.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.