基于禁忌搜索算法的改进最短路径算法  

Improvement The Shorest-Path Algorithm Based on Tabu Search

作　　者：张健龙[1] 林荣霞[1] 邱恩超[1] 莫浩明 余泽煌 

机构地区：[1]广东工业大学华立学院,广东广州511325

出　　处：《科技视界》2014年第19期55-56,共2页Science & Technology Vision

摘　　要：目前的网络已经十分庞大而链路更易发生变化但Dijkstra算法仍存在着慢收敛问题,从而影响了路由器的性能。本课题通过建立禁忌搜索算法求解最短路径优化问题的数学模型框架和各利用禁忌搜索算法的基本框架,设定禁忌表的大小,控制算法最大迭代次数范围并经过多组数据测试并验证该算法。解决Dijkstra算法最短路径的优化问题,符合现代人工智能路由器发展的趋向。The network is very large and link are more likely to change but the Dijkstra algorithm is still slow convergence problem, which affects the performance of the router.This topic through the establishment of the tabu search algorithm to solve the optimization problem of shortest path model framework and the basic frame of the tabu search algorithm, set the size of the tabu list, control algorithm of maximum number of iterations and through multiple sets of data to test and verify the algorithm. Solve the problem of Dijkstra algorithm of shortest path optimization, conforms to the tendency of the development of modern artificial intelligence router.

关 键 词：禁忌搜索算法 最短路径优化算法 智能路由 DIJKSTRA算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]