求解圆排列问题的粒子群蚁群优化算法

Particle Swarm Ant Colony Optimization Algorithm for Solving Circle Permutation Problem

提出一种求解圆排列问题的粒子群蚁群优化算法。分析了圆排列问题与旅行商问题的关系后,将圆排列问题转化为旅行商问题,并将其转化为一个优化问题。为了改善算法的性能,这里给出了利用粒子群蚁群优化算法来求解圆排列问题的四种新方案。在数值仿真中,与已有算法进行了比较,实验结果验证了所给方法是合理的和可行的。也就是说,所提四种新算法收敛速度快,寻优性能优越。

A particle swarm ant colony optimization algorithm of solving circle permutation problem was proposed. Based on the basis of analyzing relationship between circular permutation problem and traveling salesman problem, circular permutation problem was translated into traveling salesman problem, and it was further transformed into an optimization problem. In order to further improve the performance of the algorithm, here, four kinds of new scheme were proposed to solve circular permutation problem based on particle swarm ant colony optimization algorithm. In the simulation experiments, compared with the existing algorithm, the simulation results show that the proposed method is reasonable and feasible. Namely, the proposed four kinds of new algorithm have fast convergence speed and optimal performance.