Multiple Ant Colony Optimization Based on Pearson Correlation Coefficient

Ant Colony Optimization algorithms have been successfully applied to solve the Traveling Salesman Problem (TSP). However, they still have a tendency to fall into local optima, mainly resulting from poor diversity, especially in those TSPs with a lot of cities. To address this problem, and further obtain a better result in big-scale TSPs, we propose an algorithm called Multiple Colonies Ant Colony Optimization Based on Pearson Correlation Coefficient (PCCACO). To improve the diversity, first, we introduce a novel single colony termed Unit Distance-Pheromone Operator, which along with two other classic ant populations: Ant Colony System and Max-Min Ant System, make the final whole algorithm. A Pearson correlation coefficient is further employed to erect multi-colony communication with an adaptive frequency. Besides that, an initialization is applied when the algorithm is stagnant, which helps it to jump out of the local optima. Finally, we render a dropout approach to reduce the running time. The extensive simulations in TSP demonstrate that our algorithm can get a better solution with a reasonable variation.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  Guanzheng Tan,et al.  Ant Colony Optimization With Tabu Table to Solve TSP Problem , 2018, 2018 37th Chinese Control Conference (CCC).

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

[4]  Eren Özceylan,et al.  A hierarchic approach based on swarm intelligence to solve the traveling salesman problem , 2015 .

[5]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

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

[7]  Zhang Yi,et al.  Application of an Improved Ant Colony Optimization on Generalized Traveling Salesman Problem , 2012 .

[8]  Ouyang Aijia,et al.  A Hybrid Algorithm of ACO and Delete-Cross Method for TSP , 2012, 2012 International Conference on Industrial Control and Electronics Engineering.

[9]  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..

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

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

[12]  Dervis Karaboga,et al.  A combinatorial Artificial Bee Colony algorithm for traveling salesman problem , 2011, 2011 International Symposium on Innovations in Intelligent Systems and Applications.

[13]  Jeng-Shyang Pan,et al.  Ant colony system with communication strategies , 2004, Inf. Sci..

[14]  Changan Liu,et al.  A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem , 2018, IEEE Access.

[15]  Halife Kodaz,et al.  A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem , 2016, Soft Computing.

[16]  Wang Yong,et al.  Hybrid Max–Min ant system with four vertices and three lines inequality for traveling salesman problem , 2015, Soft Comput..

[17]  Hansuk Sohn,et al.  A modified ant system to achieve better balance between intensification and diversification for the traveling salesman problem , 2017, Appl. Soft Comput..

[18]  Kevin Tickle,et al.  Solving the traveling salesman problem using cooperative genetic ant systems , 2012, Expert Syst. Appl..

[19]  Shyi-Ming Chen,et al.  Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2011, Expert Syst. Appl..

[20]  Lijuan Wang,et al.  Multi-Phase Ant Colony System for Multi-Party Data-Intensive Service Provision , 2016, IEEE Transactions on Services Computing.

[21]  Musa Peker,et al.  An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method , 2013 .

[22]  Dina S. Deif,et al.  An Ant Colony Optimization Approach for the Deployment of Reliable Wireless Sensor Networks , 2017, IEEE Access.

[23]  Jacob Benesty,et al.  Pearson Correlation Coefficient , 2009 .

[24]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[25]  Paul H. Calamai,et al.  Exchange strategies for multiple Ant Colony System , 2007, Inf. Sci..

[26]  Jinzhao Wu,et al.  A discrete invasive weed optimization algorithm for solving traveling salesman problem , 2015, Neurocomputing.

[27]  D. N. Ranasinghe,et al.  Fine-tuning the Ant Colony System algorithm through Particle Swarm Optimization , 2018, ArXiv.

[28]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[29]  M. Duran Toksarı,et al.  A hybrid algorithm of Ant Colony Optimization (ACO) and Iterated Local Search (ILS) for estimating electricity domestic consumption: Case of Turkey , 2016 .

[30]  Zhaoheng Liu,et al.  Reliability optimization using multiobjective ant colony system approaches , 2005, Reliab. Eng. Syst. Saf..