.png){kind=icon}
.png){kind=icon}
Return
Robust maximum capture facility location under random utility maximization models
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2023.04.024.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study a robust version of the maximum capture facility location problem in a competitive market, as-suming that each customer chooses among all available facilities according to a random utility maximiza-tion (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, im-plying 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 robust model in protecting the decision-maker from worst-case scenarios.& COPY; 2023 Published by Elsevier B.V.
Keywords:
Facilities planning and design
Maximum capture
Random utility maximization
Robust optimization
Local search
Uuter-approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W