计算机技术与发展2011，Vol.21Issue(10)：137-139,232,4.
基于二点组合算法的旅行商问题应用性能分析
Performance Analysis of Two Vertices Combination Algorithm in TSP
摘要
Abstract
In order to efficiently solve TSP problem, given a two vertices combination algorithm based on loop transformation. Hamilton Circle is selected as the target of a solution, take any two vertices associated with edges removed to form 2 to 4 loop clips, clips of permutations and combinations of these loops, try to find better solutions replaced target solution method. Comparing this method with ant colony algorithm, its time complexity and computational accuracy are better than those of the latter. The results show that this proposed algorithm possesses a better practicability in solving the middle and small scale traveling salesman problem. So, this method has strong theoretical and practical value. It can better complete the medium-scale TSP problems, and it applied to a series of optimization.关键词
旅行商问题/二点组合算法/环路改造Key words
traveling salesman problem/two vertices combination algorithm/ loop transformation分类
信息技术与安全科学引用本文复制引用
赵玉章,郭文强,冯昊..基于二点组合算法的旅行商问题应用性能分析[J].计算机技术与发展,2011,21(10):137-139,232,4.基金项目
国家自然科学基金资助项目(60902074) （60902074）
新疆高校科研计划项目(XJEDU2009S79) （XJEDU2009S79）
