Cover Image

Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions

Nowadays, selecting the best possible solution among several solutions becomes an important skill for engineering and research. Therefore, engineers are turning to optimization methods as a complementary alternative strategy of exhaustive searching. Metaheuristic algorithms have been used successful...

Full description

Saved in:
Bibliographic Details
Main Authors: Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo
Format: Conference or Workshop Item
Language:English
English
Published: Springer Science and Business Media Deutschland GmbH 2022
Subjects:
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/34792/1/Comparison%20of%20performances%20of%20Jaya%20Algorithm%20and%20Cuckoo%20Search%20.pdf
http://umpir.ump.edu.my/id/eprint/34792/2/Comparison%20of%20performances%20of%20Jaya%20algorithm%20and%20Cuckoo_FULL.pdf
http://umpir.ump.edu.my/id/eprint/34792/
https://doi.org/10.1007/978-3-030-82616-1_11
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.ump.umpir.34792
record_format eprints
spelling my.ump.umpir.347922022-07-29T01:23:23Z http://umpir.ump.edu.my/id/eprint/34792/ Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions Ahmed, Mashuk Nasser, Abdullah B. Kamal Z., Zamli Heripracoyo, Sulistyo QA76 Computer software Nowadays, selecting the best possible solution among several solutions becomes an important skill for engineering and research. Therefore, engineers are turning to optimization methods as a complementary alternative strategy of exhaustive searching. Metaheuristic algorithms have been used successfully for solving different optimization problems. To help engineers select the best metaheuristic algorithms for their problems, there is a need to evaluate the performance of different metaheuristic algorithms against each other using common case studies. This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. CS and JA have implemented in the same platform (Intellij IDEA Community Edition 2020.2.3) using the same language (Java). The experimental results show that JA has better and consistent performance as compared to CS in most cases in terms of execution time and test suite size; however, the performance of JA is still within acceptable ranges. Springer Science and Business Media Deutschland GmbH 2022 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/34792/1/Comparison%20of%20performances%20of%20Jaya%20Algorithm%20and%20Cuckoo%20Search%20.pdf pdf en http://umpir.ump.edu.my/id/eprint/34792/2/Comparison%20of%20performances%20of%20Jaya%20algorithm%20and%20Cuckoo_FULL.pdf Ahmed, Mashuk and Nasser, Abdullah B. and Kamal Z., Zamli and Heripracoyo, Sulistyo (2022) Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions. In: Lecture Notes in Networks and Systems; International Conference on Emerging Technologies and Intelligent Systems, ICETIS 2021, 25 - 26 June 2021 , Al Buraimi. 114 -125., 299. ISSN 2367-3370 ISBN 978-303082615-4 https://doi.org/10.1007/978-3-030-82616-1_11
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
English
topic QA76 Computer software
spellingShingle QA76 Computer software
Ahmed, Mashuk
Nasser, Abdullah B.
Kamal Z., Zamli
Heripracoyo, Sulistyo
Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
description Nowadays, selecting the best possible solution among several solutions becomes an important skill for engineering and research. Therefore, engineers are turning to optimization methods as a complementary alternative strategy of exhaustive searching. Metaheuristic algorithms have been used successfully for solving different optimization problems. To help engineers select the best metaheuristic algorithms for their problems, there is a need to evaluate the performance of different metaheuristic algorithms against each other using common case studies. This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. CS and JA have implemented in the same platform (Intellij IDEA Community Edition 2020.2.3) using the same language (Java). The experimental results show that JA has better and consistent performance as compared to CS in most cases in terms of execution time and test suite size; however, the performance of JA is still within acceptable ranges.
format Conference or Workshop Item
author Ahmed, Mashuk
Nasser, Abdullah B.
Kamal Z., Zamli
Heripracoyo, Sulistyo
author_facet Ahmed, Mashuk
Nasser, Abdullah B.
Kamal Z., Zamli
Heripracoyo, Sulistyo
author_sort Ahmed, Mashuk
title Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
title_short Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
title_full Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
title_fullStr Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
title_full_unstemmed Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
title_sort comparison of performances of jaya algorithm and cuckoo search algorithm using benchmark functions
publisher Springer Science and Business Media Deutschland GmbH
publishDate 2022
url http://umpir.ump.edu.my/id/eprint/34792/1/Comparison%20of%20performances%20of%20Jaya%20Algorithm%20and%20Cuckoo%20Search%20.pdf
http://umpir.ump.edu.my/id/eprint/34792/2/Comparison%20of%20performances%20of%20Jaya%20algorithm%20and%20Cuckoo_FULL.pdf
http://umpir.ump.edu.my/id/eprint/34792/
https://doi.org/10.1007/978-3-030-82616-1_11
_version_ 1739828269846364160
score 13.211869

Similar Items