摘要
本文通过采用遗传算法来优化移动网络规划中的基站布置。解决了基站覆盖率与经济效益之间的矛盾,并且采用实验向量的编码方式对遗传算子进行描述。在遗传操作中改进了选择算子和变异算子,加快了算法的收敛速度而不会陷入局部最优。实验结果证明了算法的有效性,比别的方法更加简单和更易于实现。
Genetic Algorithms is applied into cell placement of mobile networks planning. It can settle the contradiction of cell overlay and economic benefit. And real-numbered vectors are adopted to annotate the genetic operator states. In genetic operator selection and mutation are improved. The algorithm's convergence is accelerated, and it do not drop in local optimization. The results of experiment prove the efficiency of the algorithm, compare to other algorithm, it is more simple and easy to implement.
出处
《微计算机信息》
北大核心
2006年第06X期45-47,66,共4页
Control & Automation
基金
国防科技预研基金项目
关键词
移动网络规划
基站布置
遗传算法
变异算子
mobile networks planning, cell placement, genetic algorithm, mutation