CAJ | 학술논문

目前的网络已经十分庞大而链路更易发生变化但Dijkstra算法仍存在着慢收敛问题，从而影响了路由器的性能。本课题通过建立禁忌搜索算法求解最短路径优化问题的数学模型框架和各利用禁忌搜索算法的基本框架，设定禁忌表的大小，控制算法最大迭代次数范围并经过多组数据测试并验证该算法。解决Dijkstra算法最短路径的优化问题，符合现代人工智能路由器发展的趋向。
목전적망락이경십분방대이련로경역발생변화단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.