【摘要】 TSP问题是一个经典的组合优化问题。本文采用基于凸多边形的插入方法来构造路径,然后使用调整算法对路径进行调整以缩短回路长度,最后采用遗传算法中的交叉算子,再对路径进行优化。实验结果表明,该算法具有较高精度和较强实用性。更多还原

【Abstract】 Traveling salesman problem(TSP) is a classic combinatorial optimization problem.This paper uses an insertion method which is based on convex polygon to form loop,then applies the adjustment algorithm to shorten the loop.At last the paper uses the crossover operator which is from the genetic algorithm to optimize the loop.The result of calculation shows that the method has high precision and good practicability.更多还原