基于禁忌搜索算法的改进有向赋权网络最短路径算法

The shortest algorithm of improving empowerment net work based on tabll search aglorithm

在网络优化中,路由器的网络计算能力提升可以很大程度地减少网络请求的响应时间。在传统的有向赋权最短路径求解过程中,Dijkstra算法仍存在慢收敛问题。建立一个具体的网络拓扑结构问题模型,并利用禁忌搜索算法框架,对禁忌搜索算法的常用参数进行设置,对多个实例拓扑网络结构编程求解,经多组数据测试和分析,证明该方法能适应多条路径选择,算法可行并有效。

The network computing power of the router can greatly reduce the response time of network requests in network optimization. The Dijkstra algorithm still has the problem of slow convergence in the traditional way of solving the shortest path of empowerment. Through the establishment of a specific network topology model and using the frame of the tabu search algorithm, tabu search algorithms commonly use parameter settings to solve the multiple instances of topology network structure. With the data from the test and analysis, this paper proves that the method can adapt to multiple paths to choose, so which the algorithm is feasible and effective.