Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms
This paper compares the performances of the African Buffalo Optimization (ABO), hybrid Honey Bee Mating Optimization (HBMO) and the Lin-Kernighan (LKH) algorithms for solving the problems of the Symmetric Travelling Salesman’s Problems. The three techniques have been applied successfully to solve th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IDOSI Publication
2016
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/14408/ http://umpir.ump.edu.my/id/eprint/14408/1/Solving%20Traveling%20Salesman%E2%80%99s%20Problem%20Using%20African%20Buffalo%20Optimization.pdf |
| _version_ | 1848819716087349248 |
|---|---|
| author | Odili, Julius Beneoluchi M. N. M., Kahar Noraziah, Ahmad |
| author_facet | Odili, Julius Beneoluchi M. N. M., Kahar Noraziah, Ahmad |
| author_sort | Odili, Julius Beneoluchi |
| building | UMP Institutional Repository |
| collection | Online Access |
| description | This paper compares the performances of the African Buffalo Optimization (ABO), hybrid Honey Bee Mating Optimization (HBMO) and the Lin-Kernighan (LKH) algorithms for solving the problems of the Symmetric Travelling Salesman’s Problems. The three techniques have been applied successfully to solve the popular problem of an anonymous travelling salesman who is searching for the most optimized route to visiting all his customers in different locations of a large city or in a number of cities. This study focusses on these three methods with the aim of ascertaining the most efficient and effective. Results obtained from using these algorithms to solve the benchmark dataset on TSP available in TSPLIB95 serve as the comparative data. The outcome of this experiment shows that the newly-developed African Buffalo Optimization has very encouraging performance in terms of capacity to obtain optimal or near-optimal results consistently and in the most cost-effective manner. |
| first_indexed | 2025-11-15T01:57:58Z |
| format | Article |
| id | ump-14408 |
| institution | Universiti Malaysia Pahang |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T01:57:58Z |
| publishDate | 2016 |
| publisher | IDOSI Publication |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | ump-144082017-08-15T04:37:32Z http://umpir.ump.edu.my/id/eprint/14408/ Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms Odili, Julius Beneoluchi M. N. M., Kahar Noraziah, Ahmad QA76 Computer software This paper compares the performances of the African Buffalo Optimization (ABO), hybrid Honey Bee Mating Optimization (HBMO) and the Lin-Kernighan (LKH) algorithms for solving the problems of the Symmetric Travelling Salesman’s Problems. The three techniques have been applied successfully to solve the popular problem of an anonymous travelling salesman who is searching for the most optimized route to visiting all his customers in different locations of a large city or in a number of cities. This study focusses on these three methods with the aim of ascertaining the most efficient and effective. Results obtained from using these algorithms to solve the benchmark dataset on TSP available in TSPLIB95 serve as the comparative data. The outcome of this experiment shows that the newly-developed African Buffalo Optimization has very encouraging performance in terms of capacity to obtain optimal or near-optimal results consistently and in the most cost-effective manner. IDOSI Publication 2016 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/14408/1/Solving%20Traveling%20Salesman%E2%80%99s%20Problem%20Using%20African%20Buffalo%20Optimization.pdf Odili, Julius Beneoluchi and M. N. M., Kahar and Noraziah, Ahmad (2016) Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms. World Applied Sciences Journal, 34 (7). pp. 911-916. ISSN 1818-4952. (Published) http://idosi.org/wasj/wasj34(7)16/10.pdf DOI: 10.5829/idosi.wasj.2016.34.7.329 |
| spellingShingle | QA76 Computer software Odili, Julius Beneoluchi M. N. M., Kahar Noraziah, Ahmad Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms |
| title | Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms |
| title_full | Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms |
| title_fullStr | Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms |
| title_full_unstemmed | Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms |
| title_short | Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms |
| title_sort | solving traveling salesman’s problem using african buffalo optimization, honey bee mating optimization & lin-kerninghan algorithms |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/14408/ http://umpir.ump.edu.my/id/eprint/14408/ http://umpir.ump.edu.my/id/eprint/14408/ http://umpir.ump.edu.my/id/eprint/14408/1/Solving%20Traveling%20Salesman%E2%80%99s%20Problem%20Using%20African%20Buffalo%20Optimization.pdf |