Particle Swarm Ant Colony Optimization Algorithm for Solving Circle Permutation Problem

Authors

Xiaoping Xu, 1. School of sciences, Xi'an University of Technology, Xi'an 710054, China; ;
Qiuqiu Zhu, 1. School of sciences, Xi'an University of Technology, Xi'an 710054, China; ;
Wang Feng, 2. School of Mathematics and Statistics Sciences, Xi'an Jiaotong University, Xi'an 710049, China;

Abstract

Abstract: 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.

Recommended Citation

Xu, Xiaoping; Zhu, Qiuqiu; and Feng, Wang (2020) "Particle Swarm Ant Colony Optimization Algorithm for Solving Circle Permutation Problem," Journal of System Simulation: Vol. 29: Iss. 2, Article 3.
DOI: 10.16182/j.issn1004731x.joss.201702003
Available at: https://dc-china-simulation.researchcommons.org/journal/vol29/iss2/3

First Page

248

Revised Date

2015-10-24

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201702003

Last Page

254

CLC

TP301

Recommended Citation

Xu Xiaoping, Zhu Qiuqiu, Wang Feng. Particle Swarm Ant Colony Optimization Algorithm for Solving Circle Permutation Problem[J]. Journal of System Simulation, 2017, 29(2): 248-254.

DOI

10.16182/j.issn1004731x.joss.201702003