基于LabVIEW仿真实现TSP问题的模拟退火算法

摘要

针对旅行商问题（TSP）具有的易于描述却难以处理的NP完全难题、其可能的路径数目与城市数目是呈指数型增长的、求解困难的特点。本文首次采用LabVIEW仿真实现模拟退火算法来求解该问题。仿真结果表明LabVIEW独有的数组运算规则可有效的实现该算法求解TSP问题，相比较其它方法，该方法更简单、实用、计算精度高、速度快，并且适合任意城市数目的TSP问题。%For the NP-complete hard problem which is easy to be described,but hard to be solved and the possible amounts of path increase exponentially with the amounts of city in Traveling Salesman Problem ,both resulting TSP is difficult to solve,this paper uses Simulated Annealing based on LabVIEW simulation to solve the problem for the first time. LabVIEW simulation results show that its unique array algorithms can effectively implement the Simulated annealing for TSP.Compared to other methods,this method is more simple,more practical and more precise.In addition, it has higher speed and is suitable for the TSP with any number of cities.