Description: Select the path using the simulated annealing problems, such as a traveling salesman problem, given N cities, a salesman must have visited this N cities, and each city can only be accessed once the final return to the starting of the city, it requires reasonable arrangements the access order to achieve the shortest access route target.
To Search:
File list (Check if you may need any files):
退火算法
........\Annealing algorithm.cpp
........\laimingxing_tsp.pdf
........\opt
........\source.txt
Download