关键词: 最短路径, 禁忌搜索, 网络优化, 约束, 智能计算

Abstract: In order to solve the Shortest Path（SP） problem in network optimization，this paper establishes a model with constraints for SP problem，and then explores the framework and key steps of Tabu Search（TS） for solving it.This method with advantages of intelligent computation has strong optimization ability and brief structure.It can also handle the problem constraints easily.In the end of this paper，the related algorithm is tested and compared in real example.The results indicate that the algorithm which has a good performance in convergence speed can obtain optimal solution set under certain constraints.It’s more suitable for poor network conditions.Therefore，the algorithm is feasible and effective.

Key words: shortest path, tabu search, network optimization, constraint, intelligent computation