This paper presents a simulated annealing based algorithm for traveling salesman problem (SATSP),which was applied to the symmetrical traveling salesman problem about 31 cities of China and proved to be the best of a...This paper presents a simulated annealing based algorithm for traveling salesman problem (SATSP),which was applied to the symmetrical traveling salesman problem about 31 cities of China and proved to be the best of all the algorithms at present.展开更多
文摘This paper presents a simulated annealing based algorithm for traveling salesman problem (SATSP),which was applied to the symmetrical traveling salesman problem about 31 cities of China and proved to be the best of all the algorithms at present.
