In view of the existing algorithms are of long searching time and easily to prematurely converge to the optimal solution, this paper proposes a method for solving circle permutation problem using particle swarm optimization algorithm. First of all, based on the analyzing of relationship between circular permutation problem and the traveling salesman problem, circular permutation problem is translated into traveling salesman problem and accordingly, a corresponding combinatorial optimization problem is obtained. Then, the problem is solved by particle swarm optimization algorithm. Thirdly, in order to further improve the precision of the algorithm, this paper proposes a scheme based on a hybrid particle swarm optimization algorithm. Finally, in the simulation experiments, compared with the existing algorithm, the simulation results show that the proposed method is effective.