中文摘要：

圆排列问题是一个典型的组合优化问题,也是一个NP完全问题.遗传算法是根据自然界生物学进化而发展起来的一种进化方法,其具有简单、易行、抽象性与鲁棒性特征,已成功地解决了许多工程优化问题.给出基于改进遗传算法给出求解圆排列问题的新方法.首先,分析了圆排列问题与旅行商问题之间的关系.然后,将圆排列问题转化为旅行商问题.接着,利用所给改进遗传算法进行了求解.最后,在仿真实验中,与已有算法进行了比较,结果表明,所给算法是一种能够简单有效地求解圆排列问题的新方法.

英文摘要：

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.