The Balanced Facility Location Problem: Complexity and Heuristics

References

• Addis B, Aringhieri R, Grosso A, Hosteins P (2016) Hybrid constructive heuristics for the critical node problem. Ann. Oper. Res. 238(1–2):637–649.Crossref, Google Scholar
• Bayerisches Landesamt für Umwelt (2015) Wertstoffhof 2020—Getrennthaltungsgebot und Novelle des ElektroG. Accessed December 30, 2024, https://www.bestellen.bayern.de/shoplink/lfu_abfall_00212.htm.Google Scholar
• Benlic U, Hao J-K (2013) Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219(9):4800–4815.Crossref, Google Scholar
• Costa JGC, Mei Y, Zhang M (2022) Guided local search with an adaptive neighbourhood size heuristic for large scale vehicle routing problems. Proc. Genetic Evolutionary Comput. Conf. GECCO ‘22 (Association for Computing Machinery, New York), 213–221.Google Scholar
• Delft High Performance Computing Centre (2022) DelftBlue Supercomputer (Phase 1). Accessed December 30, 2024, https://www.tudelft.nl/dhpc/ark:/44463/DelftBluePhase1.Google Scholar
• Feldman E, Lehrer FA, Ray TL (1966) Warehouse location under continuous economies of scale. Management Sci. 12(9):670–684.Link, Google Scholar
• Jacobsen SK (1983) Heuristics for the capacitated plant location model. Eur. J. Oper. Res. 12(3):253–261.Crossref, Google Scholar
• Karp RM (1972) Reducibility among combinatorial problems. Miller RE, Thatcher JW, Bohlinger JD, eds. Complexity of Computer Computations, IBM Research Symposia Series (Springer, Boston), 85–103.Crossref, Google Scholar
• Kelly FP, Maulloo AK, Tan DKH (1998) Rate control for communication networks: Shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49(3):237–252.Crossref, Google Scholar
• Krarup J, Pruzan PM (1983) The simple plant location problem: Survey and synthesis. Eur. J. Oper. Res. 12(1):36–81.Crossref, Google Scholar
• Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Management Sci. 9(4):643–666.Link, Google Scholar
• Lourenço HR, Martin OC, Stützle T (2003) Iterated local search. Glover F, Kochenberger GA, eds. Handbook of Metaheuristics (Springer, Boston), 320–353.Crossref, Google Scholar
• Martello S (1990) Knapsack Problems: Algorithms and Computer Implementations (J. Wiley & Sons, New York).Google Scholar
• Mateus GR, Resende MG, Silva RM (2011) Grasp with path-relinking for the generalized quadratic assignment problem. J. Heuristics 17(5):527–565.Crossref, Google Scholar
• McKendall A, Li C (2016) A tabu search heuristic for a generalized quadratic assignment problem. J. Indust. Production Engrg. 34(3):221–231.Crossref, Google Scholar
• Montes de Oca MA, Cotta C Ner F (2012) Local search. Neri F, Cotta C, Moscato P, eds. Handbook of Memetic Algorithms, Studies in Computational Intelligence, vol. 379 (Springer, Berlin), 29–42.Crossref, Google Scholar
• Öncan T (2007) A survey of the generalized assignment problem and its applications. INFOR Inform. Systems Oper. Res. 45(3):123–141.Crossref, Google Scholar
• Osman IH (1995) Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches. OR Spektrum 17(4):211–225.Crossref, Google Scholar
• Pinedo ML (2016) Parallel machine models (deterministic). Scheduling: Theory, Algorithms, and Systems, 5th ed. (Springer, Cham, Switzerland), 113–150.Crossref, Google Scholar
• Risanger S, Singh B, Morton D, Meyers LA (2021) Selecting pharmacies for COVID-19 testing to ensure access. Health Care Management Sci. 24(2):330–338.Crossref, Google Scholar
• Schmidt M, Singh B (2025) The balanced facility location problem: Complexity and heuristics. http://dx.doi.org/10.1287/ijoc.2024.0693.cd, https://github.com/INFORMSJoC/2024.0693.Google Scholar
• Schmitt C, Singh B (2024a) An analytical lower bound for a class of minimizing quadratic integer optimization problems. Accessed December 30, 2024, https://optimization-online.org/?p=28401.Google Scholar
• Schmitt C, Singh B (2024b) Quadratic optimization models for balancing preferential access and fairness: Formulations and optimality conditions. INFORMS J. Comput. 36(5):1150–1167.Link, Google Scholar
• Sridharan R (1995) The capacitated plant location problem. Eur. J. Oper. Res. 87(2):203–213.Crossref, Google Scholar
• Wolfe P (1959) The simplex method for quadratic programming. Econometrica 27(3):382–398.Crossref, Google Scholar