基于粒子群优化算法的网络CFA问题研究  

Study on Capacity and Flow Assignments in Computer Networks Based on Particle Swarm Optimization Algorithm

作　　者：申健[1] 佘世刚[1] 王锴[1] 黄欹昌[1] 

机构地区：[1]兰州物理研究所,兰州730000

出　　处：《计算机工程》2008年第6期179-181,共3页Computer Engineering

基　　金：中国博士后科学基金资助项目(20060390716);甘肃省自然科学基金资助项目(3ZS061-A25-023)

摘　　要：为了降低网络运营费用与改进网络性能,采用近年来新出现的一种高效的群智能搜索方法——粒子群优化算法求解计算机通信网络中链路容量与流量分配(CFA)问题。大量的计算机仿真实验结果验证了该算法在CFA问题中的有效性,而且与传统的拉格朗日松弛及子梯度寻优算法相比,解的质量有了大幅度的提高。与遗传算法相比,该算法在复杂性及运行速度等方面更具优越性。In order to decrease operation costs and improve the performance of networks, a new and efficient swarm intelligence search method based on particle swarm optimization algorithm for solving the problem of link Capacity and Flow Assignment（CFA） in computer communication networks is presented. Results of a great number of computer simulation experiments show that, not only the effectiveness of particle swarm optimization algorithm for solving CFA problem is borne out, but also, compared with the traditional lagrangean relaxation and subgradient optimization method, the obtained solution has higher accuracy, and compared with the genetic algorithm, the superiority of particle swarm optimization algorithm is further shown in the complexity and running speed.

关 键 词：容量与流量分配 组合优化 粒子群优化算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]