A Comparative Study of Neural Networks Methods and the African Buffalo Optimization for the Travelling Salesman’s Problems

摘要

This paper presents a comparative study of some Neural Networks methods and the newly-designed African Buffalo Optimization in solving 12 popular benchmark symmetric Travelling Salesman’s Problems. Recently, researchers are exploring solutions to difficult combinatorial problemsusing the Neural Networks methods. So far, the experiments have been successful. On the other hand, the metaheuristic, African Buffalo Optimization has proven to be quite effective and efficient in providing solutions to some NP-hard and NP-Complete problems, including, of course, the TravellingSalesman’s Problems. After a number of experimental evaluations on the chosen dataset, the African Buffalo Optimization was found to be more successful in solving the symmetric Travelling Salesman’s Problems under consideration.