【摘要】 使用禁忌搜索方法寻找最优路径,将最小时延路径作为初始解,在满足时延约束的情况下根据禁忌搜索规则求解代价最小的路径。仿真实验证明DCLC_TSR算法具有代价性能良好、可靠性高、耗时少、收敛速度快的优越特点。更多还原

【Abstract】 Makes use of the tabu search method to get the optimized solution. It starts with an initial least delay path, gene-rates neighborhood structure based on the k th 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.更多还原