Solving the Traveling Salesman's Problem Using the African Buffalo Optimization

This paper proposes the African Buffalo Optimization (ABO) which is a new metaheuristic algorithm that is derived from careful observation of the African buffalos, a species of wild cows, in the African forests and savannahs. This animal displays uncommon intelligence, strategic organizational skills, and exceptional navigational ingenuity in its traversal of the African landscape in search for food. The African Buffalo Optimization builds a mathematical model from the behavior of this animal and uses the model to solve 33 benchmark symmetric Traveling Salesman's Problem and six difficult asymmetric instances from the TSPLIB. This study shows that buffalos are able to ensure excellent exploration and exploitation of the search space through regular communication, cooperation, and good memory of its previous personal exploits as well as tapping from the herd's collective exploits. The results obtained by using the ABO to solve these TSP cases were benchmarked against the results obtained by using other popular algorithms. The results obtained using the African Buffalo Optimization algorithm are very competitive.

[1]  Hao-Miao Jia,et al.  A Novel Hybrid Optimization Algorithm and its Application in Solving Complex Problem , 2015 .

[2]  Xin-She Yang,et al.  Two-stage eagle strategy with differential evolution , 2012, Int. J. Bio Inspired Comput..

[3]  Adi Ben-Israel.  A Newton-Raphson method for the solution of systems of equations , 1966 .

[4]  Sudip Misra,et al.  Using bee algorithm for peer-to-peer file searching in mobile ad hoc networks , 2011, J. Netw. Comput. Appl..

[5]  S. Siva Sathya,et al.  A Survey of Bio inspired Optimization Algorithms , 2012 .

[6]  P. Siarry,et al.  An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization , 2000 .

[7]  Juan Julián Merelo Guervós,et al.  Migration study on a pareto-based island model for MOACOs , 2013, GECCO '13.

[8]  Thomas Stützle,et al.  Continuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms , 2011, Swarm Intelligence.

[9]  Li-Sheng Hu,et al.  A model induced max-min ant colony optimization for asymmetric traveling salesman problem , 2013, Appl. Soft Comput..

[10]  Zhiping Peng,et al.  Coalition Formation in Multi-agent Systems Based on Improved Particle Swarm Optimization Algorithm , 2015 .

[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 powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

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

[14]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[15]  Eligius M. T. Hendrix,et al.  On the Investigation of Stochastic Global Optimization Algorithms , 2005, J. Glob. Optim..

[16]  Janez Brest.  A Heuristic for the Asymmetric Traveling Salesman Problem , 2005 .

[17]  Julius Beneoluchi Odili.  Application of Ant Colony Optimization to Solving the Traveling Salesman's Problem , 2013 .

[18]  Dervis Karaboga,et al.  A survey: algorithms simulating bee swarm intelligence , 2009, Artificial Intelligence Review.

[19]  Özgür B. Akan,et al.  A survey on bio-inspired networking , 2010, Comput. Networks.

[20]  B. John Oommen,et al.  The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem , 1999, Neural Networks.

[21]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[22]  Caro Lucas,et al.  A novel numerical optimization algorithm inspired from weed colonization , 2006, Ecol. Informatics.

[23]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[24]  M. Clerc,et al.  Particle Swarm Optimization , 2006 .

[25]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[26]  Kenneth Sörensen,et al.  Metaheuristics - the metaphor exposed , 2015, Int. Trans. Oper. Res..

[27]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[28]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[29]  Erick Cantú-Paz,et al.  A Summary of Research on Parallel Genetic Algorithms , 1995 .

[30]  R. Ghanem,et al.  Stochastic Finite Elements: A Spectral Approach , 1990 .

[31]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[32]  Micael Gallego,et al.  GRASP and path relinking for the max-min diversity problem , 2010, Comput. Oper. Res..

[33]  DresslerFalko,et al.  A survey on bio-inspired networking , 2010 .

[34]  Shyi-Ming Chen,et al.  A new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2010, 2010 International Conference on Machine Learning and Cybernetics.

[35]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..