期刊文献+

混合蚁群算法在光网络最优环路径搜索中的应用 被引量:3

Study on optimum ring path search based on hybrid ant colony algorithm in optical networks
下载PDF
导出
摘要 路径分配问题是光环网络中的核心问题。根据遗传算法、粒子群优化算法和蚁群算法各自的特点,提出了一种融入粒子群算法和遗传算法的混合蚁群算法,用于对光网络的最优环路径的搜索。仿真结果表明,所提出的算法在收敛速度及寻优效果方面均优于基本的蚁群算法和遗传、粒子群的混合算法,证明了所提出算法的有效性。 Path assignment is a core issue for optical ring networks.On the basis of the characteristics of the Genetic Algorithm (GA),Particle Swarm Optimization (PSO)algorithm and Ant Colony Algorithm (ACA),this paper proposes a novel hybrid ACA algorithm incorporating PSO and ant GA and searches the optimal ring path in optical networks.Simulation results indi-cate that the proposed algorithm outperforms the basic ACA and the hybrid GA and PSO algorithm in terms of convergence speed and the search results,confirming its effectiveness.
作者 罗芳琼 侯睿
出处 《光通信研究》 北大核心 2014年第3期8-10,23,共4页 Study on Optical Communications
基金 国家自然科学基金资助项目(60841001) 湖北省自然科学基金资助项目(2011CDB412) 国家民委自然科学基金资助项目(12ZNZ010) 武汉市青年科技"晨光计划"项目(201150431076) 武汉市科技攻关项目(2013010501010125)
关键词 光网络 最优环 蚁群算法 粒子群优化算法 遗传算法 optical network optimal ring ACA PSO algorithm GA
  • 相关文献

参考文献12

  • 1韦乐平.光网络的发展趋势与挑战[J].电信科学,2011,27(2):1-6. 被引量:16
  • 2高志国,陈宏伟,陈明华,谢世钟.一种新型的光分组交换环网体系结构[J].光电子.激光,2005,16(10):1206-1210. 被引量:2
  • 3KOOHI S,HESSABI S,YOO S J B . An opticalwavelength switching architecture for a hingh-perform-ance low-power photonic network on chip [C]//IEEEWorkshops of International Conference on AdvancedInformation Networking and Application. Singapore:IEEE, 2011:1 - 6.
  • 4KONG M, TIAN P. A new ant colony optimization al-gorithm for the multidimensional Knapsack problem[J], Computers and Operations Research, 2008,35(8):2672-2683.
  • 5CAI J J. Chaotic ant swarm optimization to economicdispatch [J]. Electric Power Systems Research,2007,77(10) :1373-1380.
  • 6PINTEA C M , DUM ITRESCU D . Improving antsystems using a local Updating rule [C]//Proc of the7th International Symposium on Symbolic and NumericAlgorithms for Scientific Computing. Timisoara Roma-nia: IEEE,2005 :295 - 298.
  • 7NAMIH M, TAHERINEJAD N. New robust and effi-cient ant colony algorithms using new interpretation oflocal updating process [J]. Expert Systems with Appli-cations ,2009 ,(36) :481 -488.
  • 8郑卫国,田其冲,张磊.基于信息素强度的改进蚁群算法[J].计算机仿真,2010,27(7):191-193. 被引量:18
  • 9赵吉东,胡小兵,刘好斌.改进的蚁群算法及其在TSP中的应用[J].计算机工程与应用,2010,46(24):51-52. 被引量:12
  • 10柴宝杰,刘大为.基于粒子群优化的蚁群算法在TSP中的应用[J].计算机仿真,2009,26(8):89-91. 被引量:18

二级参考文献37

  • 1胡小兵,黄席樾,张著洪.一种新的自适应蚁群算法及其应用[J].计算机仿真,2004,21(6):108-111. 被引量:19
  • 2马溪骏,潘若愚,杨善林.基于信息素递减的蚁群算法[J].系统仿真学报,2006,18(11):3297-3300. 被引量:18
  • 3付宇,肖健梅.动态自适应蚁群算法求解TSP问题[J].计算机辅助工程,2006,15(4):10-13. 被引量:5
  • 4K E Parsopoulos, M N Vrahatis. Recent Approaehes to Global Optimization Problems Through Particle Swarm Optimization [ J ]. N atural Computing , 2002,1 (2 -3) :235 -306.
  • 5M Doritos, V Maniezzo, A Colorni. Positive feedback as a search strategy[ R]. Technical 91 - 016, Dipartimento di Elettronica, Politecnico di Milano, IT, 1991.
  • 6M Dorigo, G D Caro. Ant algorithms for discrete optimization [ J ]. Artificial Life, 1999, 5(3) :137 - 172.
  • 7M Dorigo, L M Gambardella. Ant colony system: a cooperative learning approach to the traveling salesman problem [ J ]. IEEE Transactions on Evolutionary Computation, 1997,1 (1) : 53 -66.
  • 8T Stutzle, H H Hoos. Max -min ant system[ J]. Future Generation Computer System, 2000,16 (8) :889 - 914.
  • 9R C Eberhart, J Kennedy. A new optimizer using particles swarm theory[ C]. Proc Sixth Int Symposium on Micro Machine and Human Science, Nagoya, 1995.39 -43.
  • 10D J Rosenkrantz, R E Stearns, P M Lewis. An analysis of several heuristics for the traveling salesman problem[ J]. SIAM J Comput, 1977, 6:563 -581.

共引文献59

同被引文献19

引证文献3

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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