.png){kind=icon}
返回
Planar maximal covering with ellipses
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2008.11.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a maximal covering location problem on the plane, where the objective is to provide maximal coverage of weighted demand points using a set of ellipses at minimum cost. The problem involves selecting k out of in ellipses. The problem occurs naturally in wireless telecommunications networks as coverage from some transmission towers takes an elliptical shape. A mixed integer nonlinear programming formulation (MINLP) for the problem is presented but MINLP solvers fail to solve it in a reasonable time. We suggest a Simulated Annealing heuristic as an alternate approach for solving the problem. Our computational results employing the heuristic show very good results with efficient processing times. We also discuss an extension to the problem where coverage occurs on a spherical surface and show that it can be solved with the same heuristic. (c) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Facility location
Maximal covering
Simulated Annealing
Elliptical covering
Wireless telecommunications networks
Mixed integer nonlinear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
An empirical comparison of Tabu Search, Simulated Annealing, and Genetic Algorithms for facilities location problems设施选址问题的禁忌搜索，模拟退火和遗传算法的经验比较
PREAI
分享收藏分享收藏分享收藏
查看更多内容