Repository: Freie Universität Berlin, Math Department

Powerful enhanced Jaya algorithm for efficiently optimizing numerical and engineering problems

Gholami, Jafar and Kamankesh, Mohamad Reza and Mohammadi, Somayeh and Hosseinkhani, Elahe and Abdi, Somayeh (2022) Powerful enhanced Jaya algorithm for efficiently optimizing numerical and engineering problems. Soft Computing . ISSN 1432-7643

Full text not available from this repository.

Official URL:


Over the last decade, the size and complexity of real-world problems have grown dramatically, necessitating more effective tools. Nature-inspired metaheuristic algorithms have proven to be a promising tool for solving such problems due to their performance in a variety of fields. JAYA algorithm is a novel population-based algorithm which could have been able to present reliable results. This is because it does not need any parameters to be set other than the population size and the maximum number of iteration. Despite its positive feedbacks, this algorithm should be modified to witness more efficiency. This paper aims to amend the original version of Jaya to present a high-efficiency version named Powerful Enhanced Jaya (PEJAYA). In other words, the methodology of updating position in Jaya is modified to enhance the convergence and search capabilities. This approach is assessed according to solve 20 well-known benchmark functions, feature selection, and statistical tests. The output results of proposed optimization algorithm are then evaluated by comparing it with other recent algorithms including crow search algorithm (CSA), standard version of JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO) and sine–cosine algorithm (SCA). Solving a real-world problem is another way of checking the efficiency of this approach with other published works. Prompt escape from local minima, superior convergence, and stability demonstrate that the suggested approach is a very powerful instrument that may be employed in a variety of optimization situations.

Item Type:Article
Subjects:Mathematical and Computer Sciences > Computer Science
Divisions:Department of Mathematics and Computer Science > Institute of Computer Science > Algorithmic Bioinformatics Group
ID Code:2810
Deposited By: Anja Kasseckert
Deposited On:21 Mar 2022 15:26
Last Modified:21 Mar 2022 15:26

Repository Staff Only: item control page