Multi-Population Ant Colony Optimization Algorithm Based on Congestion Factor and Co-Evolution Mechanism

To solve large-scale traveling salesmen problem (TSP) with better performance, we propose a multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism (CCMACO). First, the congestion factor is introduced to control the number of ants on the path and can improve the adaptability of CCMACO. Then, the sub-populations restructuring strategy is proposed to balance the convergence speed and the diversity of solutions. Besides, the inter-specific competition mechanism can be used to strengthen the optimal solution and to accelerate convergence speed. Finally, the co-evolutionary strategy is used to interchange information among different sub-populations so as to maintain the diversity of populations. For the purpose of verifying the optimization performance of the CCMACO algorithm, CCMACO is compared with several improved multi-population ant colony optimization algorithms in TSP. The experiment results show that the proposed CCMACO algorithm can effectively obtain the best optimization value in solving TSP and it achieves better optimization ability and stability.

[1]  Thomas Stützle,et al.  An analysis of communication policies for homogeneous multi-colony ACO algorithms , 2010, Inf. Sci..

[2]  Ben Niu,et al.  A Discrete Artificial Bee Colony Algorithm for TSP Problem , 2011, ICIC.

[3]  Orhan Engin,et al.  A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems , 2018, Appl. Soft Comput..

[4]  Witold Pedrycz,et al.  A comparative study of improved GA and PSO in solving multiple traveling salesmen problem , 2018, Appl. Soft Comput..

[5]  Bo Li,et al.  Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment , 2017, Applied Soft Computing.

[6]  Sheng Liu,et al.  A Novel Heuristic Communication Heterogeneous Dual Population Ant Colony Optimization Algorithm , 2017, IEEE Access.

[7]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[8]  Mohamed Kurdi,et al.  Ant colony system with a novel Non-DaemonActions procedure for multiprocessor task scheduling in multistage hybrid flow shop , 2019, Swarm Evol. Comput..

[9]  Haiyan Lu,et al.  An Improved Particle Swarm Optimization Algorithm Based on Cauchy Operator and 3-Opt for TSP , 2016, 2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT).

[10]  Jong Hyuk Park,et al.  An improved ant colony optimization-based approach with mobile sink for wireless sensor networks , 2017, The Journal of Supercomputing.

[11]  Wu Deng,et al.  An Improved Ant Colony Optimization Algorithm Based on Hybrid Strategies for Scheduling Problem , 2019, IEEE Access.

[12]  Tai-Wen Yue,et al.  Mission-Oriented Ant-Team ACO for Min-Max MTSP , 2017, 2017 International Conference on Information, Communication and Engineering (ICICE).

[13]  Juan Lin,et al.  Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem , 2017, Inf. Sci..

[14]  Hongwei Zhu,et al.  Multiple Ant Colony Optimization Based on Pearson Correlation Coefficient , 2019, IEEE Access.

[15]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[16]  Hassan Ismkhan.  Effective heuristics for ant colony optimization to handle large-scale problems , 2017, Swarm Evol. Comput..

[17]  Wu Deng,et al.  A novel collaborative optimization algorithm in solving complex optimization problems , 2016, Soft Computing.

[18]  Tengfei Zheng.  Automatic Test Case Generation Method of Parallel Multi-population Self-adaptive Ant Colony Algorithm , 2019 .

[19]  Taufik Abrão,et al.  Coordination of distance and directional overcurrent relays using an extended continuous domain ACO algorithm and an hybrid ACO algorithm , 2019, Electric Power Systems Research.

[20]  Anand Nayyar,et al.  IEEMARP- a novel energy efficient multipath routing protocol based on ant Colony optimization (ACO) for dynamic sensor networks , 2020, Multimedia Tools and Applications.

[21]  Halife Kodaz,et al.  A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem , 2015, Appl. Soft Comput..

[22]  Yang Li,et al.  The Artificial Fish Swarm Algorithm to Solve Traveling Salesman Problem , 2014 .

[23]  Bo Li,et al.  Study on an airport gate assignment method based on improved ACO algorithm , 2018, Kybernetes.

[24]  Thomas Stützle,et al.  Analysis of the population-based ant colony optimization algorithm for the TSP and the QAP , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[25]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[26]  Wu Deng,et al.  Fault Diagnosis Method Based on Principal Component Analysis and Broad Learning System , 2019, IEEE Access.

[27]  Shahid Kamal,et al.  Dynamic Optimization of Network Routing Problem through Ant Colony Optimization (ACO) , 2012 .

[28]  Jun Zhang,et al.  ACO-A*: Ant Colony Optimization Plus A* for 3-D Traveling in Environments With Dense Obstacles , 2019, IEEE Transactions on Evolutionary Computation.

[29]  Chao Wang,et al.  A multi-objective multi-population ant colony optimization for economic emission dispatch considering power system security , 2017 .

[30]  Yongchun Miao,et al.  A New Robot Navigation Algorithm Based on a Double-Layer Ant Algorithm and Trajectory Optimization , 2019, IEEE Transactions on Industrial Electronics.

[31]  Ping Zhang,et al.  Ant Colony Optimization Based Memetic Algorithm to Solve Bi-Objective Multiple Traveling Salesmen Problem for Multi-Robot Systems , 2018, IEEE Access.