计算机科学
设施选址问题
位置模型
服务(商务)
启发式
多边形(计算机图形学)
数学优化
运筹学
工程类
数学
人工智能
计算机网络
帧(网络)
经济
经济
作者
Xiaoya Ma,Xiaoyu Zhang,Xiang Zhao
标识
DOI:10.1080/13658816.2023.2193829
摘要
The reliable service coverage of many facilities or sensors used in smart city infrastructure is highly susceptible to obstructions in urban environments. Optimizing the line-of-sight (LOS) service coverage is essential to locating these facilities for smarter city services. Despite progression in the maximal coverage location problem (MCLP) model for locating facilities, maximizing the LOS service coverage in continuous demand space for facility location problems remains challenging. This study defined the LOS-constrained MCLPs (LOS-MCLPs) and proposed a service coverage optimization model to solve these LOS-MCLPs. We employed a computational geometry algorithm named the visibility polygon (VP) algorithm to simulate the LOS coverage in two-dimensional (2D) continuous demand space. We then coupled this algorithm with a robust heuristic algorithm to search for the optimal solutions to maximize effective LOS service coverage. An experiment applied the developed model to a Wi-Fi hotspot planning problem. The experimental results demonstrated that the proposed model can obtain optimal solutions for LOS-MCLPs according to the distribution of obstacles. Comparative results show that ignoring the LOS effect in the optimization of LOS-MCLPs might lead to large areas of service dead zones.
科研通智能强力驱动
Strongly Powered by AbleSci AI