Abstract
Backtracking search optimization algorithm (BSA) is new evolutionary algorithm (EA) that to solve global optimization problems. BSA is similar to evolutionary algorithm, including selection, crossover, mutation and operations. The core idea of BSA is to get guidance from the previous population and search solutions with better fitness. While BSA only evaluates the individuals based on the fitness, which could make the individuals with better exploration prospects be discarded when updating population. Thus, in this paper, we proposed a novel way to improve exploration abilities that utilize negative correlation learning enhanced search behavior in BSA to further improve its search ability. We used benchmark function suit CEC'17 to verify the proposed new algorithm and the experiment result indicates the feasibility of this hybridization.
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.
