计算机科学
成交(房地产)
数学优化
设施选址问题
区间(图论)
启发式
利润(经济学)
质量(理念)
分数(化学)
数学
人工智能
哲学
化学
有机化学
认识论
组合数学
政治学
法学
经济
微观经济学
作者
Boglárka G.-Tóth,Laura Anton-Sanchez,José María Pérez Fernández
标识
DOI:10.1016/j.ejor.2023.08.054
摘要
The problem of an expanding chain in a given area is considered. It may locate a new facility, vary the quality of its existing facilities, close some of them, or a combination of all these possibilities, whatever is the best to maximize its profit, given a budget for the expansion. A new competitive location and design model is proposed that allows all these possibilities. The resulting model is a difficult to solve MINLP problem. A branch-and-bound method based on interval analysis is proposed to cope with it. The method can solve medium-size problems in a reasonable amount of CPU time. An ad-hoc heuristic and a hybrid method that usually find a near-optimal solution in a fraction of time of the exact method are also proposed. Some computational studies are presented to show the performance of the algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI