返回
A branch-and-bound algorithm for the maximum capture problem with random utilities
DOI:10.1016/j.ejor.2015.12.026.png)
摘要
En 中文
The MAXIMUM CAPTURE PROBLEM WITH RANDOM UTILITIES seeks to locate new facilities in a competitive market such that the captured demand of users is maximized, assuming that each individual chooses among all available facilities according to the well-know a random utility model namely the multinomial logit. The problem is complex mostly due to its integer nonlinear objective function. Currently, the most efficient approaches deal with this complexity by either using a nonlinear programing solver or reformulating the problem into a Mixed-Integer Linear Programing (MILP) model. In this paper, we show how the best MILP reformulation available in the literature can be strengthened by using tighter coefficients in some inequalities. We also introduce a new branch-and-bound algorithm based on a greedy approach for solving a relaxation of the original problem. Extensive computational experiments are presented, bench marking the proposed approach with other linear and non-linear relaxations of the problem. The computational experiments show that our proposed algorithm is competitive with all other methods as there is no method which outperforms the others in all instances. We also show a large-scale real instance of the problem, which comes from an application in park-and-ride facility location, where our proposed branch-and-bound algorithm was the most effective method for solving this type of problem. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Facility location
Branch and bound
Maximum capture
Random utility model
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Structure and Electric Conductivity of Mixed Electronic–Ionic Bi2O3-Li2O-V2O5-B2O3 Glass System混合电子-离子Bi2O3-Li2O-V2O5-B2O3玻璃体系的结构和电导率
A comparison of linear reformulations for multinomial logit choice probabilities in facility location models设施选址模型中多项式logit选择概率的线性重新表述的比较

