摘要
信道分配问题属于组合优化中的 NP完备问题 ,为此在遗传算法的基础上提出了一种新的固定信道分配方法 .目标是得到一个用最少的信道数 ,满足话务需求和电磁兼容限制的信道分配方案 .采用了最小间隔编码方案和选择性变异技术 ,利用固定遗传算子 (交叉和变异 ) ,在整个迭代过程中始终满足话务需求的要求 .通过对几个著名的benchmark问题进行的仿真结果表明 。
The channel assignment problem belongs to the class of NP complete optimization problems, so we propose a new fixed channel assignment approach based on genetic algorithms. The objective is to obtain a channel assignment scheme, which satisfies both the traffic demand requirements and electromagnetic compatibility constraints with the lower bound number of channels. The minimum separation encoding scheme and the selective mutation technique were put forward, the traffic demand requirement can be fulfilled throughout the iterative process using the genetic fix operators (crossover and mutation). The results obtained by the simulation to some well known benchmark problems show that the algorithm we proposed is a better approach for solving the channel assignment problem.
出处
《小型微型计算机系统》
CSCD
北大核心
2004年第8期1420-1423,共4页
Journal of Chinese Computer Systems
基金
国家"8 63"高技术计划项目 ( 69973 0 11)资助
关键词
蜂窝系统
遗传算法
信道分配
选择性变异技术
固定遗传算子
cellular systems
genetic algorithm
channel assignment
selective mutation technique
genetic fix operators
