摘要： 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 i

关键词: 禁忌搜索算法 网络路由 启发式搜索算法 计算机网络 计算机仿真