摘要
信道分配问题属于组合优化中的NP完备问题 ,为了更有效的利用频率资源 ,在遗传算法的基础上提出了一种新的信道分配方法·在信道分配中主要考虑三种限制 :同频限制、邻频限制和同位置限制·目标是得到一个用最少的信道数 ,满足话务需求和电磁兼容限制的信道分配方案·采用了最小间隔编码方案 ,利用固定遗传算子 (交叉和变异 ) ,在整个迭代过程中始终满足话务需求的要求·提出了几种遗传算子并进行了验证 ,比较结果表明选择性变异技术能得到很好的结果·对几个著名的benchmark问题进行仿真 ,结果表明 。
In order to use the frequencies more efficiently,a new channel assignment approach based on genetic algorithms was proposed. Three constraints were considered for the channel assignment:the co channel constraint,the adjacent constraint and the co site constraint. The objective is to obtain a channel assignment scheme. The scheme satisfies both the traffic demand requirements and electromagnetic compatibility constraints with the lower bound channel number. The minimum separation encoding scheme was put forward. The traffic demand can be fulfilled throughout the iterative process using the genetic fix operators(crossover and mutation). Some GAs operators were proposed and tested. Some well known benchmark problems were simulated. The proposed algorithm is a better approach for solving the channel assignment problem.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2003年第3期213-216,共4页
Journal of Northeastern University(Natural Science)
基金
国家'八六三'高技术计划项目 ( 69973 0 11)
关键词
移动通信
蜂窝网络
遗传算法
最小间隔编码
信道分配
选择性变异算子
mobile communication
cellular networks
genetic algorithm
minimum separation encoding scheme
channel assignment
selective mutation technique
