%0 Journal Article
%T Genetic algorithm for QoS partition and routing problem<br>用遗传算法求解最优QoS 划分与路由问题*
%A LAI Wei guo
%A JI Zhong heng
%A LI Ou
%A RAN Chong senga
%A <br>来卫国
%A 季中恒
%A 李鸥
%A 冉崇森a
%J 计算机应用研究
%D 2007
%I 
%X Future communication networks were expected to full support applications with quality of service(QoS) requirements. Optimal QoS partition problem was an optimal problem for QoS applications. The paper presented a novel genetic algorithm for the OPQR problem. This algorithm used K shortest pathes instead of global search of optimal paths. Simulation results proof the efficiency of this algorithm.
%K QoS partition
%K QoS routing
%K hybrid genetic algorithm<br>服务质量划分
%K 服务质量路由
%K 遗传算法
%K 遗传算法
%K 求解
%K 最优路径
%K 划分
%K 路由问题
%K routing
%K problem
%K partition
%K algorithm
%K 有效性
%K 合理性
%K 仿真结果
%K 运行速度
%K 全网
%K 最短路径
%K 优化问题
%K 研究
%K 业务
%K 支持
%K 通信网
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=8661BA060D1BDD03&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=F3090AE9B60B7ED1&sid=11CEECA6DA9E4AC5&eid=334C61CAF4C8EF4E&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=8