An Efficient African Buffalo Optimization Algorithm for Traveling Salesman Problem Using Fuzzy Matrix

African Buffalo Optimization, as a novel evolutionary computing technique, has succeeded in many continuous problems, but research on discrete problems especially combinatorial optimization problem has been done little. In this paper, a modified African Buffalo Optimization (ABO) algorithm was proposed to solve a typical combinatorial optimization problem: Traveling Salesman Problem (TSP), which is a well-known NP-hard problem. Fuzzy Matrices were used to represent the Location and speed of the Buffaloes in ABO and the operators in the original ABO formulas were redefined. Then the algorithm was tested with concrete examples in TSPLIB, experiment shows that the algorithm can achieve good results.