| Article ID: | iaor2006584 |
| Country: | China |
| Volume: | 24 |
| Issue: | 8 |
| Start Page Number: | 102 |
| End Page Number: | 106 |
| Publication Date: | Aug 2004 |
| Journal: | Systems Engineering Theory & Practice |
| Authors: | Gao Shang, Yang Jingyu, Wu Xiaojun, Liu Tongming |
| Keywords: | optimization: simulated annealing, programming: travelling salesman |
The circle permutation problem is translated into a traveling salesman problem (TSP) firstly, then the simulated annealing algorithm (SA) is used to solve the TSP. The quality of the annealing solution is very sensitive to the way in which the trial solutions are selected. In order to search the neighborhood of the trial solution, six algorithms are put forward. By analysis and test, it is proved that an ant colony-simulated annealing algorithm, which makes use of the information of distance between cities, is a simple and effective algorithm.