.png){kind=icon}
返回
The incremental connected facility location problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2019.104763.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the incremental connected facility location problem (incremental ConFL), in which we are given a set of potential facilities, a set of interconnection nodes, a set of customers with demands, and a planning horizon. For each time period, we have to select a set of facilities to open, a set of customers to be served, the assignment of these customers to the open facilities, and a network that connects the open facilities. Once a customer is served, it must remain served in subsequent periods. Furthermore, in each time period the total demand of all customers served must be at least equal to a given minimum coverage requirement for that period. The objective is to minimize the total cost for building the network given by the investment and maintenance costs for the facilities and the network summed up over all time periods. We propose a mixed integer programming approach in which, in each time period, a single period ConFL with coverage restrictions has to be solved. For this latter problem, which is of particular interest in itself, new families of valid inequalities are proposed: these are set union knapsack cover (SUKC) inequalities, which are further enhanced by lifting and/or combined with cut-set inequalities, which are primarily used to ensure connectivity requirements. Details of an efficient branch-and-cut implementation are presented and computational results on a benchmark set of large instances are given, including examples of telecommunication networks in Germany. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Mixed integer programming
Facility location
Branch-and-cut
Multi-period network design
Incremental network design
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏Design Method of Core-Separated Assembled Buckling Restrained Braces Confined by Two Lightweight Concrete-Infilled Tubes核心分离式组装型约束耗能支撑的两种轻质混凝土填充管约束设计方法
OAAI
OAAI分享收藏Benders decomposition for very large scale partial set covering and maximal covering location problems超大规模部分集合覆盖和最大覆盖位置问题的Benders分解OAAI
OAAI分享收藏
查看更多内容