【摘要】 针对解决大规模TSP问题的求解效果在时间以及路径寻优上所存在的问题,提出一种基于分区的改进的遗传算法,并对PR144城市的TSP问题进行求解,所得最优路径结果比TSPLIB公布的已知最好解更短,实验结果显示出了本文算法求解大规模TSP问题时能求解出最优解,时间性能也很好。更多还原

【Abstract】 Aiming at the problem of time-cost and path-search when solving the large scale TSP (Traveling Salesman Problem), an improved genetic algorithm based on clustering technique is proposed to solve the PR144 cites for TSE As indicated by experi- mental results,the final path distance of the PRI44 cites for TSP is shorter than the TSPLIB known.Furthermore,the final path distance and the time cost is shorter更多还原