期刊文献+

基于改进粒子群算法的网络路由选择和CFA的优化研究 被引量:5

Study on optimizations for route selection and capacity and flow assignment in networks based on improved particle swarm optimization algorithm
在线阅读 下载PDF
导出
摘要 为了降低计算机网络的时延和运营费用以改进网络性能,首次采用一种改进的粒子群算法优化计算机网络中路由选择和链路容量与流量分配(CFA)问题。将改进算法的惯性权重改进为线性衰减的变化权重,加入了线性变化的学习因子、模拟退火机制、变异操作及邻域搜索策略,提高了算法的性能。计算机仿真结果表明,同传统优化算法相比该方法对求解网络的路由选择和CFA问题具有很大优越性。研究结果不仅对各类网络的优化问题有一定的应用价值,而且也扩展了粒子群算法的应用范围。 In order to lower delay and operational costs and improve the performance of computer networks, the problems of route selection and link capacity and flow assignments (CFA) in computer network are firstly optimized by using an improved particle swarm optimization (PSO) algorithm. The inertia weight factor is improved to linearly attenuate varying weight in the improved algorithm, and the linearly varying studying factor, the simulated annealing mechanism, the mutation operation and neighboring search strategy are added to raising performance in the algorithm. The computer simulated results show that compared with some traditional optimizing method, the great superiority of the improved PSO is further shown in solved problems of route selection and CFA in networks, The investigating results are of certain application values not only for the various network optimization problems, but also application range of the PSO algorithm is expanded.
出处 《计算机工程与设计》 CSCD 北大核心 2008年第14期3577-3578,3676,共3页 Computer Engineering and Design
关键词 计算机通信网络 粒子群算法 改进 路由选择 容量与流量分配 computer communication networks particle swarm optimization algorithm improvement route selection capacity and flow assignment (CFA)
  • 相关文献

参考文献9

二级参考文献16

  • 1何翠红,陈火旺.基于遗传算法的计算机通信网路由选择和容量分配问题新算法[J].计算机研究与发展,1997,34(S1):124-129. 被引量:5
  • 2张晓缋,戴冠中,徐乃平.一种新的优化搜索算法──遗传算法[J].控制理论与应用,1995,12(3):265-273. 被引量:97
  • 3陆传贲.排队论 [M].北京:北京邮电学院出版社,1996..
  • 4Gavish B,Neuman I. A system for routing and capacity assignment in computer communication networks[J]. IEEE Transactions on Communications,1989,37(4):360-366.
  • 5Amiri A,Pirkul H. Routing and capacity assignment in backbone communication networks [J]. Computers Operations Research, 1997,24(3): 275-287.
  • 6Glover F. Tabu search-part I [J]. ORSA Journal on Computing, 1989,1(3): 190-206.
  • 7Glover F. Tabu search-part Ⅱ[J]. ORSA Journal on Computing, 1990,2(1) : 4-32.
  • 8Lee C Y,Computers Operations Research,1997年,24卷,9期,883页
  • 9Eberhart R C, Shi Y. Comparison between genetic algorithms and particle swarm optimization[C]. Proc. 7th Ann. Conf. on Evolutionary Computation, Springer-Verlag, Berlin, 1998:611-616.
  • 10Kennedy J, Eberhart R C. Particle swarm optimization[C].Proc. IEEE Intl Conf. on Neural Networks, Perth, Australia,1995:1942-1948.

共引文献65

同被引文献27

引证文献5

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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