江汉大学学报（自然科学版）

为了解决复杂网络条件下带权最短路径问题,提出了基于压缩图的禁忌搜索算法。通过基于约束条件的图压缩算法,将复杂约束条件下的带权最短路径问题转化为旅行家问题(TSP),并通过优化禁忌搜索算法来求解复杂约束条件下带权最短路径问题。仿真结果显示,基于压缩图的禁忌搜索算法具有求解快、时间复杂度低、收敛快、对图规模和约束条件不敏感的优点。

In order to solve the problem of the shortest path with weight under complex network conditions,a tabu search algorithm based on compression graphs was proposed. With the constraint-based graph compression algorithm,the weighted shortest path problem under complex constraints was transformed into travelling salesman problem(TSP),and the optimization of the tabu searchalgorithm was used to solve the weighted shortest path problem under complex constraints. Thesimulation results showed that the tabu search algorithm based on compression graph had the advantages of fast solution,low time complexity,fast convergence,and insensitivity to graph scale and constraint conditions.