【摘要】 为探索求解大规模TSP(旅行商问题)有效实用方法,提出基于SFC(空间填充曲线)和or-opt混合算法来求解TSP,其中SFC方法能快速且有效地获得初始解,or-opt搜索算法可有效改进初始解。通过中国旅行商问题(CTSP)数据测试,无论是速度还是精度都能满足一定要求,证明这种混合算法能快速有效地解决TSP,并为解决大规模此类问题提供了一种新的思路。更多还原

【Abstract】 In order to research the solving method for a large scale TSP,this paper provides a composite algorithm based on space-filling curve(SFC) method and or-opt algorithm to solve TSP.SFC method can quickly get an initial and feasible solution.Or-opt algorithm is used to improve the initial solution.The results indicate that the algorithm’s precision and speed can meet the request of solving the China Traveling Salesman Problem(CTSP) data.The composite algorithm can solve TSP quickly and effectively,it provides a new idea to solve large scale TSP. 2 tabs,2 figs,10 refs.更多还原