A Comparative Study of African Buffalo Optimization and Randomized Insertion Algorithm for Asymmetric Travelling Salesman's Problem

• Main Authors: Odili, Julius Beneoluchi, M. N. M., Kahar, Shahid, Anwar, Azrag, M. A. K.
• Format: Conference or Workshop Item
• Language: English; English
• Published: IEEE 2015
• Subjects: QA76 Computer software
• Online Access: http://umpir.ump.edu.my/id/eprint/11856/1/A%20comparative%20study%20of%20African%20Buffalo%20Optimization%20and%20Randomized%20Insertion%20Algorithm%20for%20asymmetric%20Travelling%20Salesman%27s%20Problem.pdf; http://umpir.ump.edu.my/id/eprint/11856/7/A%20Comparative%20Study%20Of%20African%20Buffalo%20Optimization%20and%20Randomized%20Insertion%20Algorithm%20for%20Asymmetric.pdf; http://umpir.ump.edu.my/id/eprint/11856/; http://dx.doi.org/10.1109/ICSECS.2015.7333089
• Institution: Universiti Malaysia Pahang

In this study, a comparative study of the African Buffalo Optimization algorithm and the Randomized Insertion Algorithm to solving the asymmetric Travelling Salesman's Problem is made with the aim of ascertaining a better method to solving the asymmetric Travelling Salesman's Problem instances. The choice of the Random Insertion Algorithm as a comparative algorithm was informed by the fact that it has the best results in literature. The Randomized Insertion and African Buffalo Optimization algorithms employ two different methods in attempting solutions to ATSP: the African Buffalo Optimization employs the modified Karp-Steele approach while the Randomized Insertion uses random insertion approach. After attempting 15 benchmark ATSP cases out of the 19 datasets available in TSPLIB, it was discovered that the African Buffalo Optimization achieves slightly better result to the problems and at a much faster speed.