摘要
中国旅行商问题是一个著名的组合优化问题。本文从该问题的描述方法着手,提出用二叉树表示该问题中所有城市的相互关系的观点,并详细介绍了这一方法的具体实现过程。在此基础上,本文说明了如何由树根至树叶求解中国旅行商问题。采用本文方法求得的结果优于许多文献所发表的结果。本文的方法对求解许多其它旅行商问题也取得了令人满意的结果。
The Chinese Traveling Salesman Problem is very famous one of combinatorial optimization problems. This paper begins with description of the problem, proposes the new viewpoint that the problem can be expressed in a binary tree and presents its implementation procedure in detail. Based on the description with a binary tree, solution of the Chinese Traveling Salesman Problem is explained. Compared with many ones by other methods, the better result is obtained by the way proposed in this paper.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
2000年第2期222-226,共5页
Pattern Recognition and Artificial Intelligence
基金
国家973重点基础研究发展项目
关键词
组合优化
旅行商问题
二叉树
解
Combinatorial Optimization, Traveling Salesman Problem, Binary Tree
