首页 | 本学科首页   官方微博 | 高级检索  
     

3G基站选址的智能优化实现
引用本文:章杰鑫,郑羽洁.3G基站选址的智能优化实现[J].计算机工程与应用,2009,45(35):230-232.
作者姓名:章杰鑫  郑羽洁
作者单位:1. 广西经济管理干部学院图书馆,南宁,530007;桂林理工大学信息科学与工程学院,广西,桂林,541004
2. 广西经济管理干部学院图书馆,南宁,530007
摘    要:基站的位置和数量影响网络的服务质量。针对传统选址方法的不足,提出了一种基于免疫遗传算法的选址优化方法;给出了基站选址问题的多目标优化数学模型和实现过程。算法中采用了浓度调节选择概率机制,有效保证了抗体的多样性,避免了早熟收敛,并使用记忆细胞集来保存每代所产生的Pareto最优解;提出了一种邻近排挤算法对记忆细胞集进行更新、删除,保证了Pareto最优解集的分布均匀性。仿真结果表明,算法可以有效找到可行的基站布置方案,为实际工程应用提供了解决思路。

关 键 词:免疫遗传算法  基站选址  多目标优化  Pareto最优解
收稿时间:2009-9-16
修稿时间:2009-10-28  

Realization of optimization for location of 3G base stations
ZHANG Jie-xin,ZHENG Yu-jie.Realization of optimization for location of 3G base stations[J].Computer Engineering and Applications,2009,45(35):230-232.
Authors:ZHANG Jie-xin  ZHENG Yu-jie
Affiliation:1.library of Guangxi Economic Management Cadre College,Nanning 530007,China 2.Guilin University of Technology,Guilin,Guangxi 541004,China
Abstract:The number of base station location impacts the network quality of service.A new method is proposed based on immune genetic algorithm for site selection.The mathematical model of multi-objective optimization problem for base station selection and the realization of the process are given.The use of antibody concentration selection ensures the diversity of the antibody and avoiding the premature convergence,and the use of memory cells to store Pareto optimal solution of each generation.A exclusion algorithm of neighboring memory cells on the updating and deleting to ensure the Pareto optimal solution set of the distribution.The experiment results show that the algorithm can effectively find a number of possible base station and provide a solution for the practical engineering application.
Keywords:immune genetic algorithm  base station location  multi-objective optimization  Pareto optimal solution
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号