期刊文献+

多约束条件下路由选择算法研究 被引量:2

Routing selection algorithm under multiple link state limited
下载PDF
导出
摘要 采用遗传算法和蚁群算法相结合的融合算法,继承了遗传算法和蚁群算法的优点,在求精解效率上优于遗传算法,在时间效率上优于蚁群算法,能很好地实现多约束条件的最优路径计算,测试证明融合算法优化性能和时间性能都取得了很好的效果。 The Combination of Genetic Algorithm and Ant Colony Algorithm inherits the advantages of Genetic Algorithm and Ant Colony Mgorithm, and has a higher efficiency than Genetic Algorithm and a faster speed than Ant Colony Mgorithm in computing the shortest route under multi link state limited. The testing proves that the Combination Mgorithm is a new better heuristic algorithm both in the efficiency of precise results and time.
出处 《计算机应用》 CSCD 北大核心 2007年第10期2395-2397,共3页 journal of Computer Applications
基金 陕西省自然科学基金资助项目(2005F19)
关键词 遗传算法 蚁群算法 遗传—蚁群融合算法 路由选择算法 Genetic Algorithm (GA) ant colony algorithm genetic and ant colony combination algorithm routing selection algorithm
  • 相关文献

参考文献7

二级参考文献17

  • 1陈骏坚,李腊元.用扩展Dijkstra算法求解QoS问题的极限值及路由[J].武汉理工大学学报(交通科学与工程版),2004,28(6):807-810. 被引量:3
  • 2Xiao Xipeng,IEEE Network,1999年,8页 被引量:1
  • 3Ma Q,博士学位论文,1998年 被引量:1
  • 4Crawley E, Nair R. RFC2386-1998. A framework for QoS-based routing in the internet. USA: Network Working Group, 1998.1-5. 被引量:1
  • 5WilliamStallings 齐望东译.高速网络与互联网[M].北京:国防工业出版社,2003.391-395. 被引量:1
  • 6Marco Dorigo, Luca Maria Gambardella. Technical Report TR/IRIDIA/1996-3. Ant colonies for the traveling salesman problem. Belgium: IRIDIA, Universite Libre de Bruxelles, 1996.2-6. 被引量:1
  • 7Bondy TA,Murty U S R著.吴望名等译.图论及应用[M].北京:科学出版社,1984 被引量:1
  • 8J H Holland.Adaptation in Natural and Artificial System[M].Ann Arbor,MI:The University of Michigan Press,1975 被引量:1
  • 9Daniel Costa,Alain Hertz,Clivier Dubuis. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs[J] 1995,Journal of Heuristics(1):105~128 被引量:1
  • 10王征应,石冰心.基于启发式遗传算法的QoS组播路由问题求解[J].计算机学报,2001,24(1):55-61. 被引量:82

共引文献353

同被引文献17

  • 1房颉,王珩,孙亚民.一种时延约束最小代价路由选择算法[J].计算机应用研究,2005,22(6):216-218. 被引量:1
  • 2李彦华,黄华,孙绪荣.大规模网络中两种动态路由协议的分析比较[J].科学技术与工程,2006,6(9):1288-1291. 被引量:4
  • 3吴传信,倪明放,陈鸣.路由选择的一种新遗传算法[J].电子科技大学学报,2006,35(5):744-747. 被引量:8
  • 4Frigioni D, Marchetti-Spaccamela A Nanni U. Incremental Algorithms for Single-Source Shortest Path Trees [C]//Proc of the 14th Conf on Foundations of Software Technology and Theoretical Computer Science, 1994 : 113-124. 被引量:1
  • 5Frigioni D, Marchetti A, Nanni U. Fully Dynamic Output Bounded Single Source Shot-Test Path Problem[C] //Proc of the 7th ACM/ SIAM Syrup Discrete Algorithms, 1996: 212-221. 被引量:1
  • 6Xiao Bin, Cao Jiannong. Dynamic Shortest Path Tree Update for Multiple Link State Decrements[C] //Proc of the 2004 Global Telecommunications Conf, 2004:1163-1167. 被引量:1
  • 7Gavish B.An algorithm for optimal route selection in SNA networks[J].IEEE Trans on Commtmications, 1983,31 (10) : 1154-1161. 被引量:1
  • 8Tony H.Quantum computing: All introduction[J].Computing & Control Engineering Journal, 1996,10(3) : 105-112. 被引量:1
  • 9Narayanan A.Moore M, Quantum-inspired genetic algorithm[C]// Proc of IEEE International Conference on Evolutionary Computation.Piscataway:IEEE Press, 1996:61-66. 被引量:1
  • 10Han Kuk-Hyun,Kirn Jong-Hwan.Genetic quantum algorithm and its application to combinatorial optimization problem[C]//Proceedings of the 2000 Congress on Evolutionary Computation, 2000 : 1354-1360. 被引量:1

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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