期刊文献+

基于混合遗传算法的网络拓扑设计 被引量:1

A Hybrid Genetic Algorithm for Network Topology Design
下载PDF
导出
摘要 提出了一种由启发式算法和遗传算法混合使用的混合遗传算法用于通信网络中的骨干网拓扑设计。文中骨干网拓扑设计问题是在满足R边连通和跳数约束的情况下使得网络费用最小。在遗传算法中,交叉和变异操作会产生不可行解,可通过增加链路来使不可行解变为可行解。增加链路后,其费用一般要比父代个体大,并且有多余的链路。该文的混合遗传算法是在遗传算法中加入启发式策略,来消除多余的链路,降低子代的费用,加快算法的收敛速度。仿真结果验证了算法的有效性。 This paper presents a hybrid approach of genetic algorithm and heuristic algorithm for the backbone network design of communication networks. The backbone network design problem is defined as finding the network topology minimizing the the design cost of a network under R-edge-connectivity and hops-constraint considerations. The crossover and mutateon operators will produce infeasible soluteion, and infeasible soluteion becomes feasible by adding links. The offspring has higher cost than parents when adding links, and there will have redundant links. In the hybrid approach, heuristic strategy is added in genetic algorithm, it can delete redundant links to reduce the cost of the offspring that accelerates the course of algorithm. Simulation results show the effectiveness of the method.
出处 《计算机工程》 CAS CSCD 北大核心 2006年第3期25-27,87,共4页 Computer Engineering
关键词 网络设计 遗传算法 启发式算法 跳数 边连通 Network design Genetic algorithm Heuristic algorithm Hops Edge-connectivity
  • 相关文献

参考文献6

二级参考文献16

  • 1韩祯祥,文福拴.模拟进化优化方法及其应用——遗传算法[J].计算机科学,1995,22(2):47-56. 被引量:60
  • 2叶大振,吴新余.基于遗传算法的计算机通信网优化设计[J].南京邮电学院学报,1996,16(2):9-15. 被引量:10
  • 3邦迪J A 吴望名等(译).图论及其应用[M].科学出版社,1984..
  • 4Colbourn C J. The Combinatorics of Network Reliability [M]. Oxford University Press, New York, 1987.
  • 5Newport K T, Varshney P K. Design of Survivable Communication Networks under Performance Constraints [J]. IEEE Trans, On Reliability, 1991, 40(4): 433-440.
  • 6Konak Abdullah, Smith Alice E. A Hybrid Genetic Algorithm Approach for Backbone Design of Communication Networks [OL]. http://www.pitt.edu/~aesmith/postcript/cec99camera.pdf, 1999.
  • 7Reeves C R. Genetic Algorithm, Modern Heuristic Techniques for Combinatorial Problems [M]. Blackwell Scientific Publications, 1993, 151-196.
  • 8[1]ESEARAN K P, TAR JAN E R E. Augmentation problems[J]. SIAM J Comput, 1976,5(4):653 -665.
  • 9[5]MADER W. A reduction method for edge-connectivity in graphs [ J ]. Annals of Discrete Math, 1978 ( 3 ): 145 -164.
  • 10Cai Guorui,Sun Yugeng. The minimum augmentation of any graph to a k-edge-connected graph[ J ]. Networks, 1989,19 :151-172.

共引文献3

同被引文献8

引证文献1

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部