摘要：

针对传统网络基站规划方法的不足，提出一种基于免疫算法的优化方法。使用多目标优化方法对基站规划问题进行数学建模，免疫优化算法采用浓度调节选择概率机制、邻近排挤算法、循环交叉和改进的变异操作，能保证解的多样性以及Pareto最优解集均匀分布在前沿面上。仿真结果表明，该算法能够有效获得最优的基站分布方案，覆盖率达到97.6%。

关键词: 免疫算法, 基站规划, 多目标优化, Pareto最优解, 覆盖率

Abstract:

Aiming at the shortcoming of the traditional network base stations planning method, a new method is proposed based on immune algorithm. The mathematical model of multi-objective optimization problem for base station planning is given. The immune algorithm uses the mechanism for regulating the concentration of selection probability, the exclusion algorithm of neighboring memory cells, loop crossover and mutation operations. All ensure the diversity of the antibody and the Pareto optimal solution set of the distribution. Experimental results show that the algorithm can effectively find the optimal distribution scheme of base station and the coverage reaches to 97.6%.

Key words: immune algorithm, base stations planning, multi-objective optimization, Pareto optimal solution, coverage

中图分类号: 

• TP393