Circle permutation problem is translated into traveling salesman problem (TSP) firstly, then the simulated annealing algorithm (SA) is used to solve the TSP.

• 摘要首先把圆排列问题转化为旅行商问题，然后利用模拟退火算法求解此问题。