期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

利用分散搜索算法实现受时延约束的多播路由 被引量：1

Using scatter search for Delay-constrained multicast routing
在线阅读 下载PDF
导出
摘要 提出一种新的基于分散搜索算法(Scatter Search,SS)来解决受时延约束的多播路由的方法。作为进化算法的一种,分散搜索算法不但继承了进化算法中通过杂交和变异算子来增强性能的机制,还独创性地运用了"分散-收敛集聚"的迭代机制。通过在受时延约束多播路由算法上应用SS算法,寻找包含所有组播节点在内的最小代价树。实验表明,本算法具有较好的收敛性和分布性。 This paper proposed a new Delay-constrained multicast routing algorithm based on scatter search algorithm.As one of evolutionary methods,scatter search algorithm not only inherits the performance enhancing mechanism of using crossover and mutation op- erators as in genetic algorithm, but also creatively introduces an iterative mechanism which is called ＂distributing-convergence collecting＂ into it. Minimum cost tree containing all multicast nodes are found by applying SS in the Delay-constrained multicast routing algorithm. The experiment results show that this algorithm is effective.
作者 赵强 张鹏飞 孙立镌
机构地区 哈尔滨理工大学计算机科学与技术学院
出处 《软件》 2011年第11期13-16,共4页 Software
基金 国家自然科学基金No.60173055~~
关键词 多播路由算法 受时延约束 分散搜索算法 最小代价树 multicast routing algorithm Delay-constrained scatter search algorithm minimum cost tree
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1Braudes R,Zabele S. Requirements for multicast protocols [C]. Internet Engineering Task Force, RFC1458,1993.
  • 2Vachaspathi P KompeIla,Joseph C Pasquale, Ceorge C Polyzos Multicasting for multimedia applications[C]. Proceeding of Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies.Florence,ltaly: IEEE Computer Society Press,1992:2078-2085.
  • 3Marco Dorigo,LucaMaria Cambardella.Ant colony system: A cooperative learning approach to the traveling salesman problem [J].IEEE Tran on Evolutionary Computation, 1997(1):53-SG.
  • 4Hwang F K. Steiner tree problems [J].IEEE Networks 1992,22(1):55-89.
  • 5Marti R.Scatter search-wellsprings and challenges[J].European Journal of Operational Research, 2006, 169(2): 351-358.
  • 6Clover F,Lugunu M,MurLi R.Scatter Search[A].Advances in Evolutionary Computing: Theory and Application[C]. New York: Springer-Verlag, 2003: 519- 537.
  • 7Glover F.A template for scatter search and path relinking[Z].School of Business, CB 419 University of Colorado Boulder, CO 80309-0419, USA.
  • 8Salama H F, Reeves D S Evaluation of multicast routing algorithms for real-time communication on high- speed networks[J].IEEE,Journal on Selected Areas in Communications 1997,15( 3): 332-34.
  • 9Wang Z,Shi B X,Zhao E D.Bandwidth Delay Constrainted Least Cost Multicast Routing Based on Heuristic Genetic Algorithm[J]. Computer Communications,2001(24):685-692.

同被引文献19

  • 1BARBULESCU L, HOWE A E, WHITI.EY L D. Understanding algorithm performance on an oversubscribed scheduling application [J]. Artificial Intelligence Research, 2006, 27 (1) : 577- 615.
  • 2BARBULESCU L. Scheduling space ground communica tion for the air force satellite controlnetwork[J]. Journal of scheduling, 2004, 7(1):7-34.
  • 3PARISH S A. A genetic algorithm approach to automating satellite range scheduling[D]. USA: Air Force Institute of Technology, 1994.
  • 4BARBULESCU L,HOWE A,WATSON j P. Satellite range scheduling: A comparison of genetic, heuristic and local search[C]. Proceedings of the 7th International Conference on Parallel Problem-Solving From Nature. Berlin: Springer, 2002:611-620.
  • 5Zhang Na, Feng Zuren, Feng Yuanjing. An optimization model for muhisatellite resources scheduling[C]. Proceed ings of the 6th World Congress on Intelligent Control and Automation. Dalian, China, 2006 :7400-7404.
  • 6NOORUL HAQ A,SARAVANAN M,VIVEKRAJ A R. A scatter search approach for general flowshop scheduling prob lem[J]. Int J Adv Manuf Technol, 2007, 31(7-8):731- 736.
  • 7NOWICHI E, SMUTNICHI C. Some aspects o1 scatter search in the flow-shop problem[J]. European Journal of Op erational Research, 2005, 169(2) :654 -666.
  • 8Alvarez-Valdes R, CRESPO E, TAMARIT J M. A scatter search algorithm for project scheduling under partially renew able resources[J]. Journal of Heuristics 2006, 12(1-2) :95 - 113.
  • 9GLOVER F. Heuristics for integer programming using sur rogate constraints[J]. Decision Sciences, 1977, 8 ( 1 ) : 156 - 166.
  • 10GLOVER F. A template for scatter search and path retink ing, In I,ecture Notes in Computer Science, Hao J K, Lutton E, andRonald E, Editors. Berlin Springer, 1998:13- 54.

引证文献1

二级引证文献1

软件
2011年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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