Multiple ant colony optimization using both novel LSTM network and adaptive Tanimoto communication strategy

Ant Colony Optimization (ACO) tends to fall into local optima and has insufficient convergence when solving the Traveling Salesman Problem (TSP). To overcome this problem, this paper proposes a multiple ant colony optimization (LDTACO) based on novel Long Short-Term Memory network and adaptive Tanimoto communication strategy. Firstly, we introduce an Artificial Bee Colony-based Ant Colony System (ABC-ACS), which along with the classic Ant Colony System (ACS) and Max-Min Ant System (MMAS), form the final proposed algorithm. These three types of subpopulations complement each other to improve overall optimization performance. Secondly, the evaluation reward mechanism is proposed to enhance the guiding role of the Recommended paths, which can effectively accelerate convergence speed. Besides, an adaptive Tanimoto communication strategy is put forward for interspecific communication. When the algorithm is stagnant, the homogenized information communication method is activated to help the algorithm jump out of the local optima, thus improving solution accuracy. Finally, the experimental results show that the proposed algorithm can lead to more accurate solution accuracy and faster convergence speed.

[1]  Yike Guo,et al.  Hierarchical attention based long short-term memory for Chinese lyric generation , 2018, Applied Intelligence.

[2]  Safial Islam Ayon,et al.  Discrete Spider Monkey Optimization for Travelling Salesman Problem , 2020, Appl. Soft Comput..

[3]  Changhe Li,et al.  Ant Colony Optimization Algorithms for Dynamic Optimization: A Case Study of the Dynamic Travelling Salesperson Problem [Research Frontier] , 2020, IEEE Computational Intelligence Magazine.

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

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

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

[7]  Chao Gao,et al.  A New Evolutionary Multiobjective Model for Traveling Salesman Problem , 2019, IEEE Access.

[8]  Zhang Yi,et al.  Connections Between Nuclear-Norm and Frobenius-Norm-Based Representations , 2015, IEEE Transactions on Neural Networks and Learning Systems.

[9]  Min Xu,et al.  Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem , 2019 .

[10]  Shen Liu,et al.  A novel ant colony optimization based on game for traveling salesman problem , 2020, Applied Intelligence.

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

[12]  Lijin Wang,et al.  Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem , 2019, IEEE Access.

[13]  Sheng Liu,et al.  Dynamic Density Clustering Ant Colony Algorithm With Filtering Recommendation Backtracking Mechanism , 2020, IEEE Access.

[14]  Ricardo del Corazón Grau-Ábalo,et al.  Relational Agreement Measures for Similarity Searching of Cheminformatic Data Sets , 2016, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[15]  Dehui Zhang,et al.  Multi-Colony Ant Colony Optimization Based on Generalized Jaccard Similarity Recommendation Strategy , 2019, IEEE Access.

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

[17]  Emine BAŞ,et al.  Dıscrete socıal spıder algorıthm for the travelıng salesman problem , 2020, Artificial Intelligence Review.

[18]  Jürgen Schmidhuber,et al.  Long Short-Term Memory , 1997, Neural Computation.

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

[20]  Wei-Yun Yau,et al.  Structured AutoEncoders for Subspace Clustering , 2018, IEEE Transactions on Image Processing.

[21]  D. V. L. N. Somayajulu,et al.  Adaptive deep Q-learning model for detecting social bots and influential users in online social networks , 2019, Applied Intelligence.

[22]  Hainan Zhang,et al.  Multi-Population Ant Colony Optimization Algorithm Based on Congestion Factor and Co-Evolution Mechanism , 2019, IEEE Access.

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

[24]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

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

[26]  Lijuan Wang,et al.  A new asynchronous reinforcement learning algorithm based on improved parallel PSO , 2019, Applied Intelligence.

[27]  Claude E. Shannon,et al.  The mathematical theory of communication , 1950 .

[28]  Claude E. Shannon,et al.  A mathematical theory of communication , 1948, MOCO.

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

[30]  Chao Jiang,et al.  A new efficient hybrid algorithm for large scale multiple traveling salesman problems , 2020, Expert Syst. Appl..

[31]  Mir Mohammad Alipour,et al.  A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem , 2017, Neural Computing and Applications.

[32]  Kenli Li,et al.  Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP , 2014, Soft Computing.

[33]  Shengxiang Yang,et al.  Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems , 2017, IEEE Transactions on Cybernetics.

[34]  Oscar Castillo,et al.  A new approach for dynamic fuzzy logic parameter tuning in Ant Colony Optimization and its application in fuzzy control of a mobile robot , 2015, Appl. Soft Comput..

[35]  Khalid M. Salama,et al.  Parameter Self-Adaptation in an Ant Colony Algorithm for Continuous Optimization , 2019, IEEE Access.

[36]  Károly Héberger,et al.  Life beyond the Tanimoto coefficient: similarity measures for interaction fingerprints , 2018, Journal of Cheminformatics.

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

[38]  Sheng Liu,et al.  Multi-Colony Ant Algorithm Using Both Generative Adversarial Nets and Adaptive Stagnation Avoidance Strategy , 2020, IEEE Access.

[39]  Sheng Liu,et al.  Entropy-Based Dynamic Heterogeneous Ant Colony Optimization , 2019, IEEE Access.

[40]  Fei Wang,et al.  An improved ant colony optimization (I-ACO) method for the quasi travelling salesman problem (Quasi-TSP) , 2015, Int. J. Geogr. Inf. Sci..

[41]  Dirk Cattrysse,et al.  Hybrid simulated annealing and tabu search method for the electric travelling salesman problem with time windows and mixed charging rates , 2019, Expert Syst. Appl..

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

[43]  Qiong Chen,et al.  Deep reinforcement learning for imbalanced classification , 2019, Applied Intelligence.

[44]  Sahar Ebadinezhad,et al.  DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem , 2020, Eng. Appl. Artif. Intell..

[45]  Yongle Cai,et al.  A novel genetic algorithm for large scale colored balanced traveling salesman problem , 2019, Future Gener. Comput. Syst..