Abstract
This paper describes three different mechanisms used in Jellyfish Search (JS) optimiser. At first, an archive of good old solutions is used to prevent getting stuck in the local-optima area. Further, a distribution coefficient beta is adapted during the search process to control population diversity. Finally, an Eigen transformation of individuals in the reproduction process is used occasionally to cope with rotated functions. Three proposed variants of the JS optimiser are compared with the original JS algorithm and nine various well-known Nature-inspired optimisation methods when solving real-world problems of CEC 2011. Provided results achieved by statistical comparison show efficiency of the individual newly employed mechanisms.
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 callDisclaimer: 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.
