.png){kind=icon}
返回
Multi-product maximal covering second-level facility location problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2024.109961.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a new hierarchical facility location model with three levels: first -level facilities which manufacture different products, second -level facilities which act as warehouses and a third -level consisting of the clients who demand the products that have been manufactured in the first level and stored in the second level. In this model, called multi -product maximal covering second -level facility location problem (SL-MCFLP), the aim is to decide the location of the second -level facilities and the products to be stored in each of them maximizing the overall clients' satisfaction with respect their coverage. To deal with this model, we introduce a Mixed Integer Linear Program (MILP) which is reinforced by some families of valid inequalities. Since some of these families have an exponential number of constraints, separation algorithms are proposed. In addition, three variants of a matheuristic procedure are developed. Computational studies are included, showing the potentials and limits of the formulation and the effectiveness of the heuristic.
Keyword:
Hierarchical location
Covering
Integer programming
Matheuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容