An Innovative Enhanced JAYA Algorithm for the Optimization of Continuous and Discrete Problems

Metaheuristic algorithms have gained popularity in the past decade due to their remarkable ability to address various optimization challenges. Among these, the JAYA algorithm has emerged as a recent contender that demonstrates strong performance across different optimization problems, largely attributed to its simplicity. However, real-world problems have become increasingly complex in today’s era, creating a demand for more robust and effective solutions to tackle these intricate challenges and achieve outstanding results. This article proposes an enhanced JAYA (EJAYA) method that addresses its inherent shortcomings, resulting in improved convergence and search capabilities when dealing with diverse problems. The current study evaluates the performance of the proposed optimization methods on both continuous and discontinuous problems. Initially, EJAYA is applied to solve 20 prominent test functions and is validated by comparison with other contemporary algorithms in the literature, including moth–flame optimization, particle swarm optimization, the dragonfly algorithm, and the sine–cosine algorithm. The effectiveness of the proposed approach in discrete scenarios is tested using feature selection and compared to existing optimization strategies. Evaluations across various scenarios demonstrate that the proposed enhancements significantly improve the JAYA algorithm’s performance, facilitating escape from local minima, achieving faster convergence, and expanding the search capabilities.