Approximate Resolution of Stochastic Choice-Based Discrete Planning

References

• Abeliuk A, Berbeglia G, Cebrian M, Van Hentenryck P (2016) Assortment optimization under a multinomial logit model with position bias and social influence. 4OR Quart. J. Oper. Res. 14:57–75.Crossref, Google Scholar
• Alfandari L, Hassanzadeh A, Ljubić I (2021) An exact method for assortment optimization under the nested logit model. Eur. J. Oper. Res. 291(3):830–845.Crossref, Google Scholar
• Alptekinoğlu A, Semple JH (2016) The exponomial choice model: A new alternative for assortment and price optimization. Oper. Res. 64(1):79–93.Link, Google Scholar
• Altekin FT, Dasci A, Karatas M (2021) Linear and conic reformulations for the maximum capture location problem under multinomial logit choice. Optim. Lett. 15:2611–2637.Crossref, Google Scholar
• Aouad A, Feldman J, Segev D (2023) The exponomial choice model for assortment optimization: An alternative to the MNL model? Management Sci. 69(5):2814–2832.Link, Google Scholar
• Berbeglia G (2016) Discrete choice models based on random walks. Oper. Res. Lett. 44(2):234–237.Crossref, Google Scholar
• Berbeglia G, Venkataraman A (2018) The generalized stochastic preference choice model. Preprint, submitted March 7, https://arxiv.org/abs/1803.04244.Google 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.Link, Google Scholar
• Bertsimas D, Mišić VV (2019) Exact first-choice product line optimization. Oper. Res. 67(3):651–670.Link, Google Scholar
• Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Chen R, Jiang H (2020) Assortment optimization with position effects under the nested logit model. Naval Res. Logist. (Logist.NRL). 67(1):21–33.Crossref, Google Scholar
• Chen Y-C, Mišić VV (2022) Decision forest: A nonparametric approach to modeling irrational choice. Management Sci. 68(10):7090–7111.Link, Google Scholar
• Chen N, Gallego G, Tang Z (2019) The use of binary choice forests to model and estimate discrete choices. Preprint, submitted August 3, https://arxiv.org/abs/1908.01109.Google Scholar
• Davis J, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Working paper, School of Operations Research and Information Engineering, Cornell University, Ithaca, NY.Google Scholar
• Fernández P, Pelegrín B, Lančinskas A, Žilinskas J (2017) New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Comput. Oper. Res. 79:12–18.Crossref, Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, 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
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kochetov YA, Panin AA, Plyasunov AV (2015) Comparison of metaheuristics for the bilevel facility location and mill pricing problem. J. Appl. Indust. Math. 9:392–401.Crossref, 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. INFORMS J. Comput., ePub ahead of print July 15, https://doi.org/10.1287/ijoc.2023.0280.Link, Google Scholar
• Leitner M, Lodi A, Roberti R, Sole C (2024) An exact method for (constrained) assortment optimization problems with product costs. INFORMS J. Comput. 36(2):479–494.Link, Google Scholar
• Lin YH, Tian Q (2021) Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule. Eur. J. Oper. Res. 293(1):109–119.Crossref, Google Scholar
• Lin YH, Tian Q (2023) Facility location and pricing problem: Discretized mill price and exact algorithms. Eur. J. Oper. Res. 308(2):568–580.Crossref, Google 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.Crossref, 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
• Manzini P, Mariotti M (2014) Stochastic choice and consideration sets. Econometrica 82(3):1153–1176.Crossref, Google Scholar
• McFadden D (1972) Conditional Logit Analysis of Qualitative Choice Behavior (Institute of Urban and Regional Development, University of California, Berkeley).Google Scholar
• McFadden D (1981) Econometric models of probabilistic choice. Manski CF, McFadden DL, eds. Structural Analysis of Discrete Data with Econometric Applications (MIT Press, Cambridge, MA), 198–272.Google Scholar
• Méndez-Vogel G, Marianov V, Lüer-Villagra A, Eiselt H (2023) Store location with multipurpose shopping trips and a new random utility customers’ choice model. Eur. J. Oper. Res. 305(2):708–721.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
• Paneque MP, Gendron B, Lurkin V, Azadeh SS, Bierlaire M (2018) A Lagrangian relaxation technique for the demand-based benefit maximization problem. Axhausen KW, Becker F, eds. Proc. 18th Swiss Transport Res. Conf. (STRC, Ascona, Switzerland).Google Scholar
• Panin A, Plyasunov A (2014) On complexity of the bilevel location and pricing problems. J. Appl. Indust. Math. 8:574–581.Crossref, Google Scholar
• Rusmevichientong P, Shen Z-JM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Şen A, Atamtürk A, Kaminsky P (2018) A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4):994–1003.Link, Google Scholar
• Shapiro A, Dentcheva D, Ruszczynski A (2021) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Crossref, Google Scholar
• Shen J (2009) Latent class model or mixed logit model? A comparison by transport mode choice data. Appl. Econom. 41(22):2915–2924.Crossref, Google Scholar
• Taherkhani G, Alumur SA, Hosseini M (2020) Benders decomposition for the profit maximizing capacitated hub location problem with multiple demand classes. Transportation Sci. 54(6):1446–1470.Link, Google Scholar
• Talluri K, Van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• Zambrano-Rey G, López-Ospina H, Pérez J (2019) Retail store location and pricing within a competitive environment using constrained multinomial logit. Appl. Math. Model. 75:521–534.Crossref, Google Scholar
• Zhang J, Lin YH, Berbeglia G (2025) Approximate resolution of stochastic choice-based discrete planning. http://dx.doi.org/10.1287/ijoc.2024.0694.cd, https://github.com/INFORMSJoC/2024.0694.Google Scholar