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

• Main Authors: Julius Beneoluchi Odili, Mohd Nizam Mohmad Kahar
• Format: Article
• Language: English
• Published: Hindawi Limited 2016-01-01
• Series: Computational Intelligence and Neuroscience
• Online Access: http://dx.doi.org/10.1155/2016/1510256

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.