Service coverage optimization for facility location: considering line-of-sight coverage in continuous demand space

IF 4.3 1区 地球科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Geographical Information Science Pub Date : 2023-04-28 DOI:10.1080/13658816.2023.2193829
Xiaoya Ma, Xiaoyu Zhang, Xiang Zhao
{"title":"Service coverage optimization for facility location: considering line-of-sight coverage in continuous demand space","authors":"Xiaoya Ma, Xiaoyu Zhang, Xiang Zhao","doi":"10.1080/13658816.2023.2193829","DOIUrl":null,"url":null,"abstract":"Abstract 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.","PeriodicalId":14162,"journal":{"name":"International Journal of Geographical Information Science","volume":"37 1","pages":"1496 - 1519"},"PeriodicalIF":4.3000,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Geographical Information Science","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.1080/13658816.2023.2193829","RegionNum":1,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
设施选址的服务覆盖优化:考虑连续需求空间中的视线覆盖
摘要智能城市基础设施中使用的许多设施或传感器的可靠服务覆盖范围极易受到城市环境中障碍物的影响。优化视线(LOS)服务覆盖对于定位这些设施以实现更智能的城市服务至关重要。尽管设施定位的最大覆盖位置问题(MCLP)模型取得了进展,但在设施位置问题的连续需求空间中最大化服务水平服务覆盖仍然具有挑战性。本研究定义了服务水平约束的MCLP(LOS MCLP),并提出了一个服务覆盖优化模型来解决这些服务水平约束MCLP。我们采用了一种称为可见性多边形(VP)算法的计算几何算法来模拟二维(2D)连续需求空间中的服务水平覆盖。然后,我们将该算法与鲁棒启发式算法相结合,以搜索最优解,从而最大限度地提高服务水平的有效覆盖率。实验将所开发的模型应用于Wi-Fi热点规划问题。实验结果表明,该模型可以根据障碍物的分布情况获得服务水平MCLP的最优解。比较结果表明,在服务水平MCLP优化中忽略服务水平效应可能会导致大面积的服务死区。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
11.00
自引率
7.00%
发文量
81
审稿时长
9 months
期刊介绍: International Journal of Geographical Information Science provides a forum for the exchange of original ideas, approaches, methods and experiences in the rapidly growing field of geographical information science (GIScience). It is intended to interest those who research fundamental and computational issues of geographic information, as well as issues related to the design, implementation and use of geographical information for monitoring, prediction and decision making. Published research covers innovations in GIScience and novel applications of GIScience in natural resources, social systems and the built environment, as well as relevant developments in computer science, cartography, surveying, geography and engineering in both developed and developing countries.
期刊最新文献
GPU-accelerated parallel all-pair shortest path routing within stochastic road networks Collective flow-evolutionary patterns reveal the mesoscopic structure between snapshots of spatial network Geospatial foundation models for image analysis: evaluating and enhancing NASA-IBM Prithvi’s domain adaptability Translating street view imagery to correct perspectives to enhance bikeability and walkability studies A multi-view ensemble machine learning approach for 3D modeling using geological and geophysical data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1