Robust maximum capture facility location under random utility maximization models
From MaRDI portal
Abstract: We study a robust version of the maximum capture facility location problem in a competitive market, assuming that each customer chooses among all available facilities according to a random utility maximization (RUM) model. We employ the generalized extreme value (GEV) family of models and assume that the parameters of the RUM model are not given exactly but lie in convex uncertainty sets. The problem is to locate new facilities to maximize the worst-case captured user demand. We show that, interestingly, our robust model preserves the monotonicity and submodularity from its deterministic counterpart, implying that a simple greedy heuristic can guarantee a (1-1/e) approximation solution. We further show the concavity of the objective function under the classical multinomial logit (MNL) model, suggesting that an outer-approximation algorithm can be used to solve the robust model under MNL to optimality. We conduct experiments comparing our robust method to other deterministic and sampling approaches, using instances from different discrete choice models. Our results clearly demonstrate the advantages of our roust model in protecting the decision-maker from bad-case scenarios.
Recommendations
- Joint location and cost planning in maximum capture facility location under random utilities
- The maximum capture problem with random utilities: problem formulation and algorithms
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Robust stochastic facility location: sensitivity analysis and exact solution
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- A new chance-constrained maximum capture location problem
- Robustness of solutions to the capacitated facility location problem with uncertain demand
- Robust strategies for facility location under uncertainty
- Distributionally robust facility location problem under decision-dependent stochastic demand
Cites work
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- A Markov chain approximation to choice modeling
- A multicut outer-approximation approach for competitive facility location under random utilities
- Algorithms for the robust 1-center problem on a tree
- An analysis of approximations for maximizing submodular set functions—I
- An Exploration in the Theory of Optimum Income Taxation
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Discrete Choice Methods with Simulation
- Distributionally Robust Convex Optimization
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- scientific article; zbMATH DE number 3965301 (Why is no real title available?)
- Local branching
- Minimax regret p-center location on a network with demand uncertainty
- Minmax Regret Median Location on a Network Under Uncertainty
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Point-to-Set Maps in Mathematical Programming
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Robust assortment optimization in revenue management under the multinomial logit choice model
- Robust assortment optimization using worst-case CVaR under the multinomial logit model
- Robust convex optimization
- Robust linear optimization under general norms.
- Robust monotone submodular function maximization
- Robust solutions of uncertain linear programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- The impact of client choice on preventive healthcare facility network design
- The maximum capture problem with random utilities: problem formulation and algorithms
- The Price of Robustness
- Theory and applications of robust optimization
- Trust Region Methods
Cited in
(8)- A new chance-constrained maximum capture location problem
- Joint location and cost planning in maximum capture facility location under random utilities
- Online non-monotone diminishing return submodular maximization in the bandit setting
- Maximum capture location problem with random utilities and overflow penalties
- Maximizing positive influence of live-campaign promotion in live social e-commerce networks
- Constrained assortment optimization under the mixed-logit model: approximation schemes and outer approximation approaches
- An efficient variable neighborhood search approach for the facility location problem with the limited choice rule
- Sustainable EV charging infrastructure design for Tropical Islands: a case study of Mauritius
This page was built for publication: Robust maximum capture facility location under random utility maximization models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6113461)
