摘要
TSP问题(旅行商问题)是一个典型的组合优化问题,具有重要实际应用价值。对于大规模TSP问题,至今尚未找到非常有效的求解方法。为此,本文讨论了传统的确定性算法和流行的智能算法,并指出各种方法的优缺点,提出了未来求解TSP问题的发展趋势。
The traveling salesman problem （TSP） is a typical combination optimization problem, and possesses a practical application value. However, there is no effective corresponding solution to it today. So, in this paper, the traditionally affirmative methods and popular meta-heuristic methods are discussed. The advantages and disadvantages of each method are discussed. The future research direction of the TSP problem is also given.
出处
《计算机工程与科学》
CSCD
2008年第2期72-74,155,共4页
Computer Engineering & Science
基金
湖北省自然科学基金资助项目(2003ABA045)
关键词
旅行商问题
动态规划法
分枝限界法
遗传算法
郭涛算法
traveling salesman problem
dynamic program
brand and bound
genetic algorithm
Gou Tao algorithm
