A Model-Free Approach for Solving Choice-Based Competitive Facility Location Problems Using Simulation and Submodularity

References

• Aros-Vera F, Marianov V, Mitchell JE (2013) p-Hub approach for the optimal park-and-ride facility location problem. Eur. J. Oper. Res. 226(2):277–285.Crossref, Google Scholar
• Benati S (1997) Submodularity in competitive location problems. Ricerca Operativa 26:3–34.Google Scholar
• Benati S, Hansen P (2002) The maximum capture problem with random utilities: Problem formulation and algorithms. Eur. J. Oper. Res. 143(3):518–530.Crossref, Google Scholar
• Berbeglia G, Joret G (2020) Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments. Algorithmica 82(4):681–720.Crossref, Google Scholar
• Bhat CR, Guo J (2004) A mixed spatially correlated logit model: Formulation and application to residential choice modeling. Transportation Res. Part B Methodological 38(2):147–168.Crossref, Google Scholar
• Birge JR, Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3):384–392.Crossref, Google Scholar
• Blyth CR (1980) Expected absolute error of the usual estimator of the binomial parameter. Amer. Statist. 34(3):155–157.Crossref, Google Scholar
• Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, et al. (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2):186–204.Crossref, Google Scholar
• Bretagnolle J, Huber C (1978) Estimation des densités: Risque minimax. Séminaire Probabilités Strasbourg 12:342–363.Google Scholar
• Chu C (1989) A paired combinatorial logit model for travel demand analysis. Proc. 5th World Conf. Transportation Res., vol. 4 (Western Periodicals Co., Ventura, CA), 295–309.Google Scholar
• Church R, ReVelle C (1974) The maximal covering location problem. Papers Regulatory Sci. Assoc. 32:101–118.Crossref, Google Scholar
• Coniglio S, Furini F, Ljubić I (2022) Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Math. Programming 196(1–2):9–56.Crossref, 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.Crossref, Google Scholar
• Crainic TG, Hewitt M, Maggioni F, Rei W (2021) Partial benders decomposition: General methodology and application to stochastic network design. Transportation Sci. 55(2):414–435.Link, Google Scholar
• Dam TT, Ta TA, Mai T (2022) Submodularity and local search approaches for maximum capture problems under generalized extreme value models. Eur. J. Oper. Res. 300(3):953–965.Crossref, Google Scholar
• Davis JM, Topaloglu H, Williamson DP (2017) Pricing problems under the nested logit model with a quality consistency constraint. INFORMS J. Comput. 29(1):54–76.Link, Google Scholar
• Do Carmo MP (2016) Differential Geometry of Curves and Surfaces: Revised and Updated, 2nd ed. (Courier Dover Publications, Mineola, NY).Google Scholar
• Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming 36(3):307–339.Crossref, Google Scholar
• Fosgerau M, McFadden D, Bierlaire M (2013) Choice probability generating functions. J. Choice Modelling 8:1–18.Crossref, Google Scholar
• Freire AS, Moreno E, Yushimito WF (2016) A branch-and-bound algorithm for the maximum capture problem with random utilities. Eur. J. Oper. Res. 252(1):204–212.Crossref, Google Scholar
• Gallego G, Wang R (2014) Multiproduct price optimization and competition under the nested logit model with product-differentiated price sensitivities. Oper. Res. 62(2):450–461.Link, Google Scholar
• Haase K (2009) Discrete location planning. Technical report ITLS-WP-09-07, Institute of Transport and Logistics Studies, University of Sydney, Sydney, NSW.Google Scholar
• Haase K, Müller S (2013) Management of school locations allowing for free school choice. Omega 41(5):847–855.Crossref, Google Scholar
• Haase K, Müller S (2014) A comparison of linear reformulations for multinomial logit choice probabilities in facility location models. Eur. J. Oper. Res. 232(3):689–691.Crossref, Google Scholar
• Haase K, Müller S, Krohn R, Hensher D (2016) The maximum capture problem with flexible substitution patterns. Working paper, Hamburg University, Hamburg, Germany.Google Scholar
• Haase K, Knörr L, Krohn R, Müller S, Wagner M (2019) Facility location in the public sector. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer, Cham, Switzerland), 745–764.Google Scholar
• Hochbaum DS, Pathria A (1998) Analysis of the greedy approach in problems of maximum k-coverage. Naval Res. Logist. 45(6):615–627.Crossref, Google Scholar
• Holguin-Veras J, Reilly J, Aros-Vera F (2012) New York city park and ride study. Technical report, University Transportation Research Center, New York.Google Scholar
• Kim S, Pasupathy R, Henderson SG (2015) A guide to sample average approximation. Fu MC, ed. Handbook of Simulation Optimization (Springer, New York), 207–243.Google 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.Link, Google Scholar
• Legault R, Frejinger E (2024) A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity. http://dx.doi.org/10.1287/ijoc.2023.0280.cd, https://github.com/INFORMSJoC/2023.0280.Google Scholar
• Li H, Webster S, Mason N, Kempf K (2019) Product-line pricing under discrete mixed multinomial logit demand: Winner—2017 M&SOM practice-based research competition. Manufacturing Service Oper. Management 21(1):14–28.Link, Google Scholar
• Liu N, Ma Y, Topaloglu H (2020) Assortment optimization under the multinomial logit model with sequential offerings. INFORMS J. Comput. 32(3):835–853.Link, Google Scholar
• Ljubić I, Moreno E (2018) Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Eur. J. Oper. Res. 266(1):46–56.Crossref, Google Scholar
• Mai T, Lodi A (2020) A multicut outer-approximation approach for competitive facility location under random utilities. Eur. J. Oper. Res. 284:874–881.Crossref, Google Scholar
• McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15(5):447–470.Crossref, Google Scholar
• Méndez-Vogel G, Marianov V, Lüer-Villagra A (2023) The follower competitive facility location problem under the nested logit choice rule. Eur. J. Oper. Res. 310(2):834–846.Crossref, Google Scholar
• Miyamoto K, Vichiensan V, Shimomura N, Páez A (2004) Discrete choice model with structuralized spatial effects for location analysis. Transportation Res. Rec. 1898(1):183–190.Crossref, Google Scholar
• Müller S, Haase K, Seidel F (2012) Exposing unobserved spatial similarity: Evidence from German school choice data. Geographical Anal. 44(1):65–86.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1981) Maximizing submodular set functions: Formulations and analysis of algorithms. North-Holland Math. Stud. 59:279–301.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions—I. Math. Programming 14:265–294.Crossref, Google Scholar
• Paneque MP, Bierlaire M, Gendron B, Azadeh SS (2021) Integrating advanced discrete choice models in mixed integer linear optimization. Transportation Res. Part B Methodological 146:26–49.Crossref, Google Scholar
• Paneque MP, Gendron B, Azadeh SS, Bierlaire M (2022) A Lagrangian decomposition scheme for choice-based optimization. Comput. Oper. Res. 148:105985.Crossref, Google Scholar
• Pinsker MS (1964) Information and Information Stability of Random Variables and Processes (Holden-Day, San Francisco).Google Scholar
• Rusmevichientong P, Shen ZJM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production Oper. Management 23(11):2023–2039.Crossref, Google Scholar
• Salvador S, Chan P (2004) Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms. Proc. 16th IEEE Internat. Conf. Tools Artificial Intelligence (IEEE, Piscataway, NJ), 576–584.Google Scholar
• Satopää V, Albrecht J, Irwin D, Raghavan B (2011) Finding a “kneedle” in a haystack: Detecting knee points in system behavior. Proc. 31st Internat. Conf. Distributed Comput. Systems Workshops (IEEE, Piscataway, NJ), 166–171.Google Scholar
• Schrijver A (2003) Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin).Google Scholar
• Vovsha P (1997) The cross-nested logit model: Application to mode choice in the Tel-Aviv metropolitan area. Transportation Res. Rec. 1607:13–20.Google Scholar
• Williams HC (1977) On the formation of travel demand models and economic evaluation measures of user benefit. Environment. Planning A 9(3):285–344.Crossref, Google Scholar
• Yaglom AM, Yaglom IM (1987) Challenging Mathematical Problems with Elementary Solutions, vol. 1 (Courier Corporation, Chelmsford, MA).Google Scholar
• Zhang Y, Berman O, Verter V (2012) The impact of client choice on preventive healthcare facility network design. OR Spectrum 34(2):349–370.Crossref, Google Scholar
• Zhang H, Rusmevichientong P, Topaloglu H (2020) Assortment optimization under the paired combinatorial logit model. Oper. Res. 68(3):741–761.Link, Google Scholar