Coverage area maximization with parallel simulated annealing
作者：
Highlights：
• Sits k equal disk-like facilities maximizing their covering.
• Probabilistically estimates the area covered by the disks.
• Optimization strategy based on parallel simulated annealing.
• Achieves nearly optimal locations in very reasonable running times.
• Automatically setting the SA algorithm parameters.
摘要
•Sits k equal disk-like facilities maximizing their covering.•Probabilistically estimates the area covered by the disks.•Optimization strategy based on parallel simulated annealing.•Achieves nearly optimal locations in very reasonable running times.•Automatically setting the SA algorithm parameters.
论文关键词：Facilities placement,Service coverage,Multiple services,Covered area,Simulated annealing,Parallel GPU processing
论文评审过程：Received 12 July 2021, Revised 10 January 2022, Accepted 1 April 2022, Available online 13 April 2022, Version of Record 30 April 2022.
论文官网地址：https://doi.org/10.1016/j.eswa.2022.117185
