检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华北科技学院电子信息工程系,北京东燕郊101601 [2]中国矿业大学(北京)计算机系,北京10083
出 处:《辽宁工程技术大学学报(自然科学版)》2006年第B06期172-174,共3页Journal of Liaoning Technical University (Natural Science)
摘 要:针对目前多约束组播路由算法中存在的算法复杂,不能求出其精确解和运算量大,解不稳定等问题提出了一种新的组播路由优化算法,其核心是采用改进的遗传算法。该算法采用模拟退火算法与遗传算法相结合的方法,编码采用实数编码结构,交叉和变异概率适当选择,合理设计适应度函数。仿真结果表明,该算法是有效的,稳定的,比传统遗传算法性能优越,具有较强的实用性。In view of some problems of present multicast routing algorithms like the complexities of the algorithm, the imprecise results of the problem, a mass of calculation, unstable results and so on, a new multicast routing optimization algorithm which kernel is the improved Genetic Algorithm to resolve the problem is provided. The algorithm adopts the Genetic Algorithm combined with the Simulated Annealing algorithm. The encoding of the algorithm is a structure of real serial number. The adaptive mutation probability and cross probability are suitable for the problem. The function of adaptive degree is designed suitably for the algorithm. Simulation results show the algorithm is effective and stable. The performance is better than the traditional genetic algorithm. Thereby a better practicality can be provided for the algorithm.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7