Title: Modified Jaya algorithm with chaos

Authors: Mingjing Pei; Shuhao Yu; Maosheng Fu; Xukun Zuo

Addresses: School of Information Engineering, West Anhui University, 237012 Lu'an, China ' School of Information Engineering, West Anhui University, 237012 Lu'an, China ' School of Information Engineering, West Anhui University, 237012 Lu'an, China ' School of Information Engineering, West Anhui University, 237012 Lu'an, China

Abstract: A simple and new optimisation algorithm for solving constrained and unconstrained optimisation problems (Jaya) is a recently developed optimisation algorithm, which is a new optimisation algorithm designed to solve optimisation related problems, it has two random parameters in equations. In the study of this paper, we will introduce chaos into Jaya so as to increase non-repeatability and ergodicity for global optimisation. Here, four different chaotic maps are utilised to control random parameters in Jaya. The results show that some chaotic maps can outperform the random parameters in the high-dimensional function and the result of the two-dimensional function is almost the same.

Keywords: Jaya algorithm; chaos; optimisation algorithm; non-repeatability; high-dimensional function; ergodicity.

DOI: 10.1504/IJRIS.2021.117076

International Journal of Reasoning-based Intelligent Systems, 2021 Vol.13 No.3, pp.132 - 138

Received: 02 Feb 2019
Accepted: 27 Aug 2019

Published online: 05 Aug 2021 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article