期刊文献+

基于初始环编码的遗传算法优化网络拓扑结构问题 被引量:1

Research of Topology Optimization Based on Genetic Algorithm with Initialized Ring
下载PDF
导出
摘要 论文以最小化网络直径及网络成本为优化目标,基于遗传算法优化网络拓扑结构问题提出了一种新颖的基于初始环的网络编码方法。该方法以网络的布尔邻接矩阵作为个体染色体,以邻接矩阵中随机对称窗口为交叉对象构造交叉算子。试验表明,该方法在全局搜索及快速收敛能力方面都有良好表现,能够很快求解到较优化的拓扑结构方案。 This paper aims at the optimization of the network cost and the minimization of the network diameter.A new network code method has been proposed based on an initialized ring.This new algorithm uses the adjacent matrix as individual chromosome and the random symmetrical window as the crossover window.In practice,it has a good ability of global searching and convergence.Optimization solution for large-scale network can be found quickly.
出处 《计算机工程与应用》 CSCD 北大核心 2006年第26期147-149,共3页 Computer Engineering and Applications
基金 国家自然科学基金资助项目(编号:60473085) 国家973重点基础研究发展规划资助项目(编号:2003CB314804)
关键词 拓扑优化 遗传算法 初始环编码 网络直径 topology optimization,Genetic Algorithm,initialized ring,network diameter
  • 相关文献

参考文献8

  • 1B Parhami,M Rakov.Perfect difference networks and related interconnection structure for parallel and distributed systems[J].IEEE Trans on Parallel and Distributed Systems,2005; 16 (8):1 ~ 11
  • 2Sharma U,Misra K B,Bhattacharji A K.Application of an efficient search technique for optimal design of a computer communication network[J].Micro-electron Reliab,1991 ;31:337~341
  • 3R H Jan,F J Hwang,S T Cheng.Topological optimization of a communication network subject to a reliability constraint[J].IEEE Trans Reliability,1993 ;42 (1):63~70
  • 4J Plesnik.The complexity of designing a network with minimum diameter[J].Networks,1981; 11:77~85
  • 5M Faloutsos,P Faloutsos,C Faloutsos.On power-law relationships of the Internet topology[C].In:Proc of ACM SIGCOMM,1999-08
  • 6M Rakov.Hyperstar and Hyperhub.Optical networks Interconnection methods and structures.US Patent Application No.09/6340129,2000-08
  • 7A Globus,S Atsatt,J Lawton et al.JavaGenes:evolving graphs with crossover[R].NAS Technical Report NAS-00-018,2000-10
  • 8S Pettie.A new approach to all-pairs shortest paths on real-weighted graphs[J].Theoretical Computer Science,2004; 312 (1):47~74

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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