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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Reasoning-based Intelligent Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
