检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:喻歆[1]
出 处:《电讯技术》2014年第3期348-354,共7页Telecommunication Engineering
摘 要:给出了战场频率分配问题的形式化定义,并提出了一类标准问题测试集。针对问题特点,指出了现有频率分配策略的局限性,提出了一种基于种群迁移策略的战场频率动态分配新算法。新策略中,算法每一次迭代结束前,都以随机候选解和基于上一代最优解生成的候选解作为迁移种群来替换当前种群中较差的解,其中,迁移种群的生成过程受当前可用频率资源的限制。仿真结果表明,新提出的算法能够有效求解战场频率动态分配问题。The formalized definition of the frequency assignment problem (FAP) in battlefield environmentis given, and a class of benchmark test problems is proposed. According to the characteristics of the prob-lem, the limitations of existing frequency assignment strategies are pointed out, and a new approach basedon immigrant schemes is proposed. In particular, at the end of each iteration, based on random solutionsand the best solution of the last iteration, an immigrant population which conforms to the resource con-straint is generated to replace the worst solutions of the current population. Simulation results show that theproposed new approach can successfully solve the FAP in battlefield environment.
分 类 号:TN92[电子电信—通信与信息系统] TP301.6[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3