|
计算机应用研究 2005
A Heuristic Algorithm for Delay-constrained Least-cost Unicast Routing
|
Abstract:
Makes use of the tabu search method to get the optimized solution. It starts with an initial least delay path, generates neighborhood structure based on the kth shortest path algorithm, and finds the optimized route satisfying constraint. A large number of simulations demonstrate that the algorithm has advantages of nice cost performance, high reliability, and fast convergence speed.