Circle permutation problem is a typical combinatorial optimization problem; moreover, it is a NP complete problem. Genetic algorithm is a kind of evolutionary method based on natural biological evolution. It is simple and easy, and has characteristics of abstraction and robustness. which has been successfully applied to many engineering optimization problems. A new method based on improved genetic algorithm is presented for solving circle permutation problem. Firstly, the relationship between circular permutation problem and the traveling salesman problem is analyzed, and then circular permutation problem is translated into traveling salesman problem. Next, it is solved by the improved genetic algorithm. Finally, in the simulation experiments, compared with the existing algorithm, the proposed method is a simple and effective algorithm for solving circle permutation problem.