Research on Base Station Location Problem Solved Based on Simulated Annealing Algorithm

Lin Chen

doi:10.54097/zghsa269

Authors

Lin Chen

DOI:

https://doi.org/10.54097/zghsa269

Keywords:

Establishment of a 0-1, SA, Sensitivity Analysis, Base Station Site Selection

Abstract

With the widespread adoption of 5G technology, the existing base stations, both in number and coverage, are insufficient to meet current societal needs. Therefore, establishing suitable new base stations within the current coverage area has become a significant challenge. To address this issue, this paper collects data on weak coverage areas and previously established base stations in those areas. The collected data undergoes a series of processing and analysis steps. Then, a suitable 0-1 programming mathematical model is established using methods for handling complex programming problems. Simulated annealing is then employed to solve the 0-1 programming model. Finally, further sensitivity analysis is conducted. The optimized solution yields a cost of 23.35 million yuan to establish new base stations in weak coverage areas, resulting in a total of 310 new base stations, including 225 macro base stations and 85 micro base stations. The sensitivity analysis in this paper effectively verifies the rationality of the 0-1 programming model and the accuracy of the simulated annealing algorithm. This study determines how to rationally establish new base stations in weak areas, which has important reference value for the future establishment of new base stations in weak areas.

Downloads

Download data is not yet available.

References

[1] Zhao Zhenyu, Lin Shan, Ma Qianxin. Integrated energy system shared energy storage planning based on split-blob bar optimization [J]. Electric Power Construction, 2025, 46(11): 58-70.

[2] Gao Xuejun, Yang Lu. Regional sensitivity study of bogie critical speed [J]. Journal of Hunan University (Natural Science Edition), 2025, 52(10): 50-57.

[3] Zhou Xiaodong, Sun Shuai, Du Longkun, et al. Sensitivity analysis of mid-infrared single-photon correlation imaging (invited) [J]. Acta Optica Sinica, 2025, 45(20): 377-389.

[4] Zhu Yalan. Sensitivity and specificity analysis of cardiac color Doppler ultrasound in the diagnosis of coronary heart disease complicated with heart failure [J]. Practical Medical Imaging Journal, 2025, 26(05):393-397.

[5] Huang Fengshou, Li Jiacheng, Sun Xing, et al. Lightweight improvement design of bus frame structure based on sensitivity analysis [J]. Bus Technology and Research, 2025, 47(05):40-46.

[6] Xie Yunquan, Zhu Weixing, Gu Min, et al. Sensitivity Analysis Method for Military Software Capabilities Based on Neural Networks [J/OL]. Command Control and Simulation, 1-12 [2025-11-13].

[7] Li Minghao, Niu Hao, Fan Jiayi, et al. Sensitivity Analysis and Optimization Design of Coal Mining Machine Spiral Drum Based on Discrete Element Method [J]. Journal of Henan Polytechnic University (Natural Science Edition), 2025, 44(06):165-171.

[8] Li Hongwei, Ying Changjie, Guan Guan. [9] Li Ming, Liu Huali, Xing Ying, et al. BP neural network blasting fly rock distance prediction model based on simulated annealing optimization [J/OL]. Command, Control and Simulation, 1-11 [2025-11-13].

[9] Chen Jie, Zhuang Bailiang, Yang Baohua, et al. NSGA-SA: Simulated Annealing Enhanced Multi-Objective Optimization Algorithm and Its Application in Heat Treatment [J]. Software Guide, 2025, 24(09): 87-98.

[10] Zhou Xingjian, Zhang Zuhan, Ai Zhen. Research on Site Selection and Layout of Public Charging Stations for New Energy Vehicles Based on Bi-Objective 0-1 Programming [J]. Logistics Technology, 2025, 44(07): 60-72.

[11] Li Congqing. Research on Vehicle Pickup and Delivery Transportation Path Based on Simulated Annealing Algorithm [J]. Journal of Zhengzhou Railway Vocational and Technical College, 2025, 37(01): 49-53.

[12] Wang Yun. Research on Last-Line Vehicle-Mounted UAV Logistics Delivery Route Planning Based on Simulated Annealing Algorithm [J]. Automation and Instrumentation, 2025, (02): 247-251.

[13] Zhuang Yuxi. Research on 0-1 Quadratic Programming Problem Solving Algorithm Based on Graph Neural Network [D]. Shanghai University, 2023.

[14] Liao Yifei. Research on Ship Domestic Sewage Disposal Strategy Based on 0-1 Programming [J]. Ship Materials and Market, 2023, 31(04): 107-111.

[15] He Kun, Ren Shuo, Guo Zijie, et al. Local Dynamic Programming Algorithm for Solving Complete 0-1 Knapsack Problem Based on Greedy Backtracking [J]. Journal of Huazhong University of Science and Technology (Natural Science Edition), 2024, 52(02): 16-21.

[16] Liu Shangyi, Wu Tao. 0-1 Linear Programming Model and Application Based on Mixed Variables [J]. Science and Technology Innovation, 2023, (01): 92-95.

[17] Wang Maoping, Pan Dazhi. An improved dynamic programming algorithm for solving the set-valued discount {0-1} knapsack problem [J]. Computer Applications and Software, 2022, 39(09):274-277.

[18] Qian Haochen, Jiang Xintong, Li Xuanhao, et al. Landscape planning and design of resettlement community based on POE theory - a case study of Nanjing Zijin Moxiangyuan [J]. Urban Architecture, 2022, 19(13):15-18.