Abstract
Cuckoo search (CS) is one of the recent population-based algorithms used for solving continuous optimization problems. The most known problem for optimization techniques is balancing between exploration and exploitation. CS uses two search strategies to updating the nest: local and global search. Although cuckoo search are adequate for the exploration, it is not well enough the exploitation. Only one search equation is used for local search, this equation remains incapable and causes some deficiencies about the exploitation. To enhance the ability of exploitation and to balance between global search and local search, different search strategies were implemented in CS algorithm. The proposed method was compared with basic CS on well-known unimodal and multimodal benchmark functions. Experimental results show that the proposed method is more successful than the basic CS in terms of solution quality.
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 Intelligent Systems and Applications in Engineering
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.
