A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Research on TSP Solution Based on Improved Simulated Annealing Algorithm
2018
Proceedings of the 2017 4th International Conference on Machinery, Materials and Computer (MACMC 2017)
unpublished
Travelling Salesman Problem (TSP) is a typical combinatorial optimization problem. The main idea of the problem is that given a number of cities and the distances between each city and tries to get the shortest path that visits each city exactly once and back to the starting point. This report introduces multiple arithmetic operators to improve the simulated annealing algorithm to apply in the solution of TSP. The result shows that the improved simulated annealing algorithm is effective and
doi:10.2991/macmc-17.2018.27
fatcat:t7lofq7amvbitam2tcol3zjswi