A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem

The Ant Colony Optimization (ACO) is easy to fall into the local optimum and its convergence speed is slow in solving the Travelling Salesman Problem (TSP). Therefore, a Slime Mold-Ant Colony Fusion Algorithm (SMACFA) is proposed in this paper. Firstly, an optimized path is obtained by Slime Mold Algorithm (SMA) for TSP; Then, the high-quality pipelines are selected from the path which is obtained by SMA, and the two ends of the pipelines are as fixed-point pairs; Finally, the fixed-point pairs are directly applied to the ACO by the principle of fixed selection. Hence, the SMACFA with fixed selection of high-quality pipelines is obtained. Through the test of the chn31 in Traveling Salesman Problem Library (TSPLIB), the result of path length was 15381 by SMACFA, and it was improved by 1.42% than ACO. The convergence speed and algorithm time complexity were reduced by 73.55 and 80.25% respectively. What’s more, under the ten data sets of TSPLIB, SMACFA outperformed other algorithms in terms of the path length, convergence speed and algorithm time complexity by comparison experiments. It is fully verified that the performances of SMACFA is superior to others in solving TSP.

[1]  Hassan Mathkour,et al.  Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem , 2019, Sensors.

[2]  Jeff Jones,et al.  Computation of the travelling salesman problem by a shrinking blob , 2013, Natural Computing.

[3]  Huiling Chen,et al.  Slime mould algorithm: A new method for stochastic optimization , 2020, Future Gener. Comput. Syst..

[4]  Shengxiang Yang,et al.  Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors , 2013, Appl. Soft Comput..

[5]  Tsuyoshi Otake,et al.  Novel Routing Method Using Slime Mold Algorithm Corresponding to Movement of Content Source in Content-Oriented Networks , 2019 .

[6]  Toshiyuki Nakagaki,et al.  Physarum solver: A biologically inspired method of road-network navigation , 2006 .

[7]  Xin-She Yang,et al.  Random-key cuckoo search for the travelling salesman problem , 2015, Soft Comput..

[8]  Weihao Liang,et al.  Research on Ant Colony Optimization Tabu Search and Genetic Fusion Algorithm , 2018, 2018 2nd International Conference on Robotics and Automation Sciences (ICRAS).

[9]  Silja Meyer-Nieberg,et al.  Coordinating a team of searchers: of ants, swarms, and slime molds , 2017, GECCO.

[10]  Marek Kopel,et al.  Solving dynamic TSP by parallel and adaptive ant colony communities , 2019, J. Intell. Fuzzy Syst..

[11]  Zili Zhang,et al.  A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model , 2014, Bioinspiration & biomimetics.

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

[13]  Manoranjan Maiti,et al.  Multi-objective four dimensional imprecise TSP solved with a hybrid multi-objective ant colony optimization-genetic algorithm with diversity , 2019, J. Intell. Fuzzy Syst..

[15]  Zili Zhang,et al.  A new multi-agent system to simulate the foraging behaviors of Physarum , 2017, Natural Computing.

[16]  Toshiyuki Nakagaki,et al.  Flow-network adaptation in Physarum amoebae , 2008, Theory in Biosciences.

[17]  Francisco Herrera,et al.  Analysis of the Best-Worst Ant System and Its Variants on the QAP , 2002, Ant Algorithms.

[18]  Ana Paias,et al.  Heuristic approaches for the family traveling salesman problem , 2021, Int. Trans. Oper. Res..

[19]  Yang Jia-ben,et al.  AN IMPROVED ANT COLONY ALGORITHM BASED ON ADAPTIVELY=ADJUSTING PHEROMONE , 2002 .

[20]  Vincenzo Bonifaci,et al.  Physarum can compute shortest paths: A short proof , 2013, Inf. Process. Lett..

[21]  A. Tero,et al.  A mathematical model for adaptive transport network in path finding by true slime mold. , 2007, Journal of theoretical biology.

[22]  Akio Ishiguro,et al.  Enhancing adaptability of amoeboid robot by synergetically coupling two decentralized controllers inspired by true slime mold , 2015, Adapt. Behav..

[23]  Keiji Yamanaka,et al.  Parallel island based Memetic Algorithm with Lin-Kernighan local search for a real-life Two-Echelon Heterogeneous Vehicle Routing Problem based on Brazilian wholesale companies , 2019, Appl. Soft Comput..

[24]  Guangjie Han,et al.  An Improved Ant Colony Algorithm for Path Planning in One Scenic Area With Many Spots , 2017, IEEE Access.

[25]  Andrew Adamatzky,et al.  Slime mould imitates development of Roman roads in the Balkans , 2015 .

[26]  Manas Kumar Maiti,et al.  A Hybrid PSO-GA Algorithm for Traveling Salesman Problems in Different Environments , 2019, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[27]  Keld Helsgaun,et al.  Solving Arc Routing Problems Using the Lin-Kernighan-Helsgaun Algorithm , 2015 .

[28]  Quan-feng Qiu,et al.  Theoretical Analysis on Initial Pheromone Values for ACO , 2012 .

[29]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[30]  Gloria Cerasela Crişan,et al.  On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP , 2020 .

[31]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[32]  Andrew Adamatzky,et al.  Route 20, Autobahn 7, and Slime Mold: Approximating the Longest Roads in USA and Germany With Slime Mold on 3-D Terrains , 2012, IEEE Transactions on Cybernetics.

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

[34]  Zili Zhang,et al.  A multi-objective ant colony optimization algorithm based on the Physarum-inspired mathematical model , 2014, 2014 10th International Conference on Natural Computation (ICNC).

[35]  Miao Yu.  A solution of TSP based on the ant colony algorithm improved by particle swarm optimization , 2019 .

[36]  A. Tero,et al.  Minimum-risk path finding by an adaptive amoebal network. , 2007, Physical review letters.

[37]  Z. Zhang,et al.  Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems , 2016, PloS one.

[38]  Sankaran Mahadevan,et al.  A Bio-Inspired Approach to Traffic Network Equilibrium Assignment Problem , 2018, IEEE Transactions on Cybernetics.

[39]  T. Nakagaki,et al.  Intelligence: Maze-solving by an amoeboid organism , 2000, Nature.

[40]  Mohammad Hadi Afshar,et al.  Hybridizing ant colony optimization algorithm with nonlinear programming method for effective optimal design of sewer networks. , 2019, Water environment research : a research publication of the Water Environment Federation.

[41]  Matthias Becker.  On the quality of graphs generated by swarm algorithms , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[42]  T. Niizato,et al.  An adaptive and robust biological network based on the vacant-particle transportation model. , 2011, Journal of theoretical biology.

[43]  Kazuyuki Aihara,et al.  Amoeba-Based Emergent Computing: Combinatorial Optimization and Autonomous Meta-Problem Solving , 2010, Int. J. Unconv. Comput..