.png){kind=icon}
返回
Multi-type maximal covering location problems: Hybridizing discrete and continuous problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.10.037.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a general modeling framework for a multi-type maximal covering location problem in which the position of facilities in different normed spaces are simultaneously decided to maximize the demand generated by a set of points. From the need of intertwining location decisions in discrete and in continuous sets, a general hybridized problem is considered in which some types of facilities are to be located in finite sets and the others in continuous normed spaces. A natural non-linear model is proposed for which an integer linear programming reformulation is derived. A branch-and-cut algorithm is developed for better tackling the problem. The study proceeds considering the particular case in which the continuous facilities are to be located in the Euclidean plane. In this case, by taking advantage from some geometrical properties it is possible to propose an alternative integer linear programming model. The results of an extensive battery of computational experiments performed to assess the methodological contribution of this work is reported. Apart from a synthetic dataset, the different approaches are tested on a real geographical and demographic data with up to 920 demand nodes.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Location
Integer programming
Maximal covering location
Multiple facility types
Discrete -continuous hybridization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏Tabu based heuristics for the generalized hierarchical covering location problem基于禁忌的广义分层覆盖选址问题的启发式算法
PREAI
分享收藏Benders decomposition for very large scale partial set covering and maximal covering location problems超大规模部分集合覆盖和最大覆盖位置问题的Benders分解OAAI
OAAI分享收藏
查看更多内容