添改了一些词,有几个句子稍微改了一下顺序,有的变为从句连贯些,供参考~
Traveling Salesman Problem（TSP）is a typical NP-hard problem in combinatorial optimization field, of which the solution time is exponential with the increase of the problem scale.Since traditional optimization algorithm fails to meet demand, what based on intelligent algorithms for TSP has been a hot topic in recent years.
Simulated annealing algorithm is a random iterative optimization algorithm that combines the physical annealing process and Combinatorial Optimization,which converges to the overall optimal solution by Metropolis criteria.Using Simulated annealing algorithm to solve the TSP problem is an ideal method.
This design uses simulated annealing algorithm to solve TSP problem, and has made designs of the city's position and its algorithm rules, according to the characteristics of TSP problem and simulated annealing algorithm. A basic window is constructed based on C++, which has defined random city positions in the window. At the same time, neighborhood search methods and the Calculation of Path difference are designed to speed up algorithm speed. Experimental test results show that this design has achieved good effects. 添改了一些词,有几个句子稍微改了一下顺序,有的变为从句连贯些,供参考~
Traveling Salesman Problem（TSP）is a typical NP-hard problem in combinatorial optimization field, of which the solution time is exponential with the increase of the problem scale.Since traditional optimization algorithm fails to meet demand, what based on intelligent algorithms for TSP has been a hot topic in recent years.
Simulated annealing algorithm is a random iterative optimization algorithm that combines the physical annealing process and Combinatorial Optimization,which converges to the overall optimal solution by Metropolis criteria.Using Simulated annealing algorithm to solve the TSP problem is an ideal method.
This design uses simulated annealing algorithm to solve TSP problem, and has made designs of the city's position and its algorithm rules, according to the characteristics of TSP problem and simulated annealing algorithm. A basic window is constructed based on C++, which has defined random city positions in the window. At the same time, neighborhood search methods and the Calculation of Path difference are designed to speed up algorithm speed. Experimental test results show that this design has achieved good effects.