摘要
针对计算机网络规模日益扩大所带来的网络路由优化问题,将其数学本质规划为NP问题,提出使用粒子群优化算法求得路由优化的近似最优解。同时,为了提高粒子群算法的性能引入了变异机制,使粒子群算法的进化速度得到明显提升。仿真实验表明,提出的方法可以在较短时间内得到路由优化的结果,具有较好的有效性和实用性。
The network routing optimization problem is increasingly evident with the growing scale of computer network.In order to solve this problem,which the mathematical essence is the NP problem,the method of using particle swarm algorithm to obtain approximate optimal solution is proposed.Meanwhile,in order to improve the performance of PSO,mutation mechanism is introduced,so that the speed of evolution particle swarm algorithm has been significantly improved.Simulation results show that the proposed method can be obtain route optimization results in a relatively short period of time,and it has relatively effectiveness and practicality.
出处
《微型电脑应用》
2014年第7期22-25,共4页
Microcomputer Applications
基金
河南省教育厅科技攻关项目(No.13A520786)
河南省科技攻关项目(No.122102210510)
关键词
网络路由
粒子群算法
优化
Network Routing
PSO Algorithm
Optimistic
