Performance Analysis of Jaya Algorithm Using CEC’2013 Benchmark Functions

Autor:	Amol C. Adamuthe, S. B. Darade, A. J. Umbarkar
Rok vydání:	2020
Předmět:	education.field_of_study Computer science Random number generation Population size Population Evolutionary algorithm Benchmark (computing) education Control parameters Algorithm Evolutionary computation
Zdroj:	Advances in Intelligent Systems and Computing ISBN: 9789811507502
DOI:	10.1007/978-981-15-0751-9_56
Popis:	Jaya algorithm is population-based parameter less heuristic algorithm. The algorithm requires only control parameters like population size and a number of iterations and two stochastic steps (three random number generators). This paper presents an investigation of Jaya algorithm on Congress on Evolutionary Computation 2013 test functions. The experimental results show that Jaya is performing satisfactorily for 28 benchmark functions for lower dimensions and performance degrades for higher dimensions.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f5c3ab4850f6f57d43f9ecfcd7a8ec24 https://doi.org/10.1007/978-981-15-0751-9_56 Zobrazit plný text záznamu