基于模拟退火算法的移动站址规划问题

Mobile Site Planning Based on Simulated Annealing Algorithm

摘要: 本文主要是以研究解决现网弱覆盖区域的覆盖问题，在给定区域内的2500 × 2500个点中选择站址的坐标，进行站址规划，使得弱覆盖点总业务量的90%被规划基站覆盖。通过构建目标线性规划模型，采用迭代算法得出最优的解决方案，进行基站的站址规划，通过清洗数据，根据宏基站和微基站的最小门限对现有基站与弱覆盖点之间的距离进行判断，筛选出不符合要求的点并进行删除，减小数据的运算量。最后利用模拟退火算法，改变初始布置宏基站的数量与初始布置微基站的数量，对目标函数进行优化得到了宏基站与微基站的最佳数量搭配，实现覆盖率达到90.1%。

Abstract: This paper mainly studies to solve the coverage problem of the weak coverage area of the existing network. The coordinates of the site are selected from 2500 × 2500 points in a given area to carry out site planning, so that 90% of the total service volume of the weak coverage points is covered by the planned base station. By constructing the target linear programming model, the iterative algo-rithm is adopted to obtain the optimal solution, and the site planning of the base station is carried out. By cleaning the data, the distance between the existing base station and the weak coverage point is determined according to the minimum threshold of the macro station and the micro base station, and the points that do not meet the requirements are screened out and deleted, so as to reduce the amount of data computation. Finally, the simulated annealing algorithm was used to change the number of initial layout of macro stations and the number of initial layout of micro base stations, and the objective function was optimized to get the optimal number of macro stations and micro base stations, and the coverage rate reached 90.1%.