African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems

This paper presents a comparative study of the African Buffalo Optimization algorithm and the Randomized Insertion Algorithm to solving the asymmetric Travelling Salesman’s Problem with the overall objective of determining a better method to solving the asymmetric Travelling Salesman’s Problem insta...

Full description

Saved in:
Bibliographic Details
Main Authors: Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad, Odili, Esther Abiodun
Format: Article
Language:English
Published: JATIT 2016
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/6806/1/fskkp-2016-nizam-African%20Buffalo%20Optimization.pdf
http://umpir.ump.edu.my/id/eprint/6806/
http://www.jatit.org/volumes/Vol87No3/1Vol87No3.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.ump.umpir.6806
record_format eprints
spelling my.ump.umpir.68062018-02-02T06:51:11Z http://umpir.ump.edu.my/id/eprint/6806/ African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems Odili, Julius Beneoluchi M. N. M., Kahar Noraziah, Ahmad Odili, Esther Abiodun QA76 Computer software This paper presents a comparative study of the African Buffalo Optimization algorithm and the Randomized Insertion Algorithm to solving the asymmetric Travelling Salesman’s Problem with the overall objective of determining a better method to solving the asymmetric Travelling Salesman’s Problem instances. Our interest in the asymmetric Travelling Salesman’s Problem (ATSP) is borne out of the fact that most practical daily-life problems are asymmetric rather than symmetric. The choice of the Random Insertion Algorithm as a comparative algorithm was informed by our desire to investigate the general belief among the scientific community that Heuristics being mostly problem-dependent algorithms are more efficient that metaheuristics that are usually general-purpose algorithms. Moreover, both the metaheuristic, the African Buffalo Optimization and the Heuristic, Randomized Insertion Algorithms hold some of the best results in literature in solving the ATSP. Similarly, both methods employ different search techniques in attempting solutions to the ATSP: while the African Buffalo Optimization uses the modified Karp-Steele technique, the Randomized Insertion employs random insertion mechanism. After investigating all the 19 benchmark ATSP datasets available in TSPLIB, it was discovered that the Randomized Insertion Algorithm achieves slightly better result to the problems but the African Buffalo Optimization is much faster JATIT 2016 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/6806/1/fskkp-2016-nizam-African%20Buffalo%20Optimization.pdf Odili, Julius Beneoluchi and M. N. M., Kahar and Noraziah, Ahmad and Odili, Esther Abiodun (2016) African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems. Journal of Theoretical and Applied Information Technology, 87 (3). pp. 356-364. ISSN 1992-8645 (print); 817-3195 (online) http://www.jatit.org/volumes/Vol87No3/1Vol87No3.pdf
institution Universiti Malaysia Pahang
building UMP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Pahang
content_source UMP Institutional Repository
url_provider http://umpir.ump.edu.my/
language English
topic QA76 Computer software
spellingShingle QA76 Computer software
Odili, Julius Beneoluchi
M. N. M., Kahar
Noraziah, Ahmad
Odili, Esther Abiodun
African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
description This paper presents a comparative study of the African Buffalo Optimization algorithm and the Randomized Insertion Algorithm to solving the asymmetric Travelling Salesman’s Problem with the overall objective of determining a better method to solving the asymmetric Travelling Salesman’s Problem instances. Our interest in the asymmetric Travelling Salesman’s Problem (ATSP) is borne out of the fact that most practical daily-life problems are asymmetric rather than symmetric. The choice of the Random Insertion Algorithm as a comparative algorithm was informed by our desire to investigate the general belief among the scientific community that Heuristics being mostly problem-dependent algorithms are more efficient that metaheuristics that are usually general-purpose algorithms. Moreover, both the metaheuristic, the African Buffalo Optimization and the Heuristic, Randomized Insertion Algorithms hold some of the best results in literature in solving the ATSP. Similarly, both methods employ different search techniques in attempting solutions to the ATSP: while the African Buffalo Optimization uses the modified Karp-Steele technique, the Randomized Insertion employs random insertion mechanism. After investigating all the 19 benchmark ATSP datasets available in TSPLIB, it was discovered that the Randomized Insertion Algorithm achieves slightly better result to the problems but the African Buffalo Optimization is much faster
format Article
author Odili, Julius Beneoluchi
M. N. M., Kahar
Noraziah, Ahmad
Odili, Esther Abiodun
author_facet Odili, Julius Beneoluchi
M. N. M., Kahar
Noraziah, Ahmad
Odili, Esther Abiodun
author_sort Odili, Julius Beneoluchi
title African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
title_short African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
title_full African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
title_fullStr African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
title_full_unstemmed African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
title_sort african buffalo optimization and the randomized insertion algorithm for the asymmetric travelling salesman’s problems
publisher JATIT
publishDate 2016
url http://umpir.ump.edu.my/id/eprint/6806/1/fskkp-2016-nizam-African%20Buffalo%20Optimization.pdf
http://umpir.ump.edu.my/id/eprint/6806/
http://www.jatit.org/volumes/Vol87No3/1Vol87No3.pdf
_version_ 1643665470559092736
score 13.211869