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

Odili, Julius Beneoluchi and M. N. M., Kahar (2016) Solving the Traveling Salesman’s Problem using the African Buffalo Optimization. Computational Intelligence and Neuroscience, 2016. pp. 1-12. ISSN 1687-5265 (print); 1687-5273 (online). (Published)

Solving the Traveling Salesman’s Problem using the African Buffalo Optimization.pdf
Available under License Creative Commons Attribution.

Download (1MB) | Preview


This paper proposes the African Buffalo Optimization (ABO) which is a new meta-heuristic 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.

Item Type: Article
Additional Information: Article ID 1510256
Uncontrolled Keywords: African Buffalo Optimization (ABO)
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Mrs. Neng Sury Sulaiman
Date Deposited: 01 Dec 2015 06:16
Last Modified: 24 Jun 2016 03:04
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item