.png){kind=icon}
返回
Integer linear programming models for grid-based light post location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.04.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Selecting optimal location is a key decision problem in business and engineering. This research focuses to develop mathematical models for a special type of location problems called grid-based location problems. It uses a real-world problem of placing lights in a park to minimize the amount of darkness and excess supply. The non-linear nature of the supply function (arising from the light physics) and heterogeneous demand distribution make this decision problem truly intractable to solve. We develop ILP models that are designed to provide the optimal solution for the light post problem: the total number of light posts, the location of each light post, and their capacities (i.e., brightness). Finally, the ILP models are implemented within a standard modeling language and solved with the CPLEX solver. Results show that the ILP models are quite efficient in solving moderately sized problems with a very small optimality gap. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Linear programming
Location analysis
Grid-based location problems
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study用遗传算法求解大规模最大期望覆盖选址问题的比较研究
PREAI
分享收藏Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm单源容量约束的多设施韦伯问题 -- 一种迭代两阶段启发式算法
PREAI
分享收藏
查看更多内容