节点文献
基于GP的移动网络规划算法研究
Research on GP-based Algorithm in Mobile Network Planning
【摘要】 CDMA基站分布规划受到众多条件制约,因此通常属于NP-Hard问题,而GP基于自然进化的思想,是一种高效的算法,根据求解问题的特点,将改进的GP应用于CDMA基站分布规划,利用GP灵活的个体表示得到自然描述的个体解,使基站分布易于理解,利用GP全局寻优的能力得到较好的基站分布,从而降低误报率和漏报率。对GP的改进体现在2个方面:①扰动算子;②改进的适应度函数。最后用实验证明了改进GP的有效性和先进性。
【Abstract】 The base station placement planning of CDMA network involves a lot of factors,usually belongs to NP-Hard problems.GP,based on basic concepts of biological reproduction and evolution,is a powerful technology.According to the characteristic of the base station placement planning of CDMA network,we improve GP and apply it to the base station placement planning of CDMA network in this paper.We make use of flexible encoding of GP to gain individual depicted naturally,so that the base station placement is easy to be understood,and make use of GP’s powerful search performance to gain better base station placement.The method proposed in this paper has the following characteristics:① disorder operator in order to resolve the problem of population’s identity.② Improve fitness function.Finally,we show experimental results,in this way,we prove our method’s validity and advantage.
【Key words】 GP; CDMA; Base station placement planning; fitness function;
- 【文献出处】 无线电通信技术 ,Radio Communications Technology , 编辑部邮箱 ,2008年01期
- 【分类号】TN929.5
- 【被引频次】2
- 【下载频次】77