摘要
Routing problem is a very import problem in the network design. However, with the increasing of the number of vertices, the convergence speed of the conventional method (such as the Dijkstra algorithm) becomes slow. In some services, the accurate shortest path isn't requested. This paper presents a new algorithm for solving this problem based on the tabu search technique. The tabu search algorithm can get the satisfied path with the changing of the iteration times, the tabu period and neighborhood size. Simulation results demonstrate that the proposed method is very efficient for computing the shorted path, especially when the scale of the network is large.
Routing problem is a very import problem in the network design. However, with the increasing of the number of vertices, the convergence speed of the conventional method (such as the Dijkstra algorithm) becomes slow. In some services, the accurate shortest path isn't requested. This paper presents a new algorithm for solving this problem based on the tabu search technique. The tabu search algorithm can get the satisfied path with the changing of the iteration times, the tabu period and neighborhood size. Simulation results demonstrate that the proposed method is very efficient for computing the shorted path, especially when the scale of the network is large.
出处
《计算机科学》
CSCD
北大核心
2003年第6期55-57,共3页
Computer Science
