An Improved Jaya Optimization Algorithm with Hybrid Logistic-Sine-Cosine Chaotic Map

Abstract

Jaya optimization algorithm is a simple but powerful intelligence optimization method which has several outstanding characteristics of both population-based algorithms and swarm intelligence-based algorithms. It has shown great potentials to solve various hard and complex optimization problems, but there still has much room to improve its performance, especially for solving high-dimensional and non-convex problems. Hence, this paper proposes an improved Jaya optimization algorithm with a novel hybrid logistic-sine-cosine chaotic map, which is named IJaya for short. The hybrid logisticsine-cosine chaotic map is applied to balance the exploration and the exploitation processes of Jaya optimization algorithm. Seven benchmark testing functions with different scale settings are used to evaluate the performance of our improved algorithm. Computational results indicate that our improved Jaya optimization algorithm outperforms greatly its original version on most testing functions with high-dimensions.