Experimental Investigation of Ant Supervised by Simplified PSO with Local Search Mechanism (SAS-PSO-2Opt)

Self-adapting heuristics is a very challenging research issue allowing setting a class of solvers able to overcome complex optimization problems without being tuned. Ant supervised by PSO, AS-PSO, as well as its simplified version SASPSO was proposed in this scope. The main contribution of this paper consists in coupling the simplified AS-PSO with a local search mechanism and its investigations over standard test benches, of TSP instances. Results showed that the proposed method achieved fair results in all tests: find the best-known solution or even find a better one essentially for the following cases: eil51, berlin52, st70, KroA100 and KroA200. The proposed method turns better results with a faster convergence time than the classical Ant Supervised by PSO and the standard Ant Supervised by PSO as well as related solvers essentially for eil51, berlin52, st70 and kroA100 TSP test benches.

[1]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

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

[3]  Gabriella Kókai,et al.  Self-adaptive ant colony optimisation applied to function allocation in vehicle networks , 2007, GECCO '07.

[4]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[5]  Nizar Rokbani,et al.  Ant supervised by PSO , 2009, 2009 4th International Symposium on Computational Intelligence and Intelligent Informatics.

[6]  Andrew J. Chipperfield,et al.  Simplifying Particle Swarm Optimization , 2010, Appl. Soft Comput..

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

[8]  Leandro Nunes de Castro,et al.  A Neuro-Immune Network for Solving the Traveling Salesman Problem , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

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

[10]  A. Alimi,et al.  Inverse Kinematics Using Particle Swarm Optimization, A Statistical Analysis , 2013 .

[11]  Cheng-Fa Tsai,et al.  A new hybrid heuristic approach for solving large traveling salesman problem , 2004, Inf. Sci..

[12]  Adel M. Alimi,et al.  Fuzzy Ant Supervised by PSO and simplified ant supervised PSO applied to TSP , 2013, 13th International Conference on Hybrid Intelligent Systems (HIS 2013).

[13]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

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

[15]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[16]  Leandro Nunes de Castro,et al.  A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem , 2009, Inf. Sci..

[17]  Xie Jian-ying.  An Adaptive Ant Colony Optimization Algorithm and Simulation , 2002 .

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

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

[20]  Adel M. Alimi,et al.  Ant supervised by PSO and 2-Opt algorithm, AS-PSO-2Opt, applied to Traveling Salesman Problem , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).