Abstract
Recently, a metaheuristic algorithm called spherical search (SS) has been proposed. The main operations of SS are the calculation of spherical boundary and generation of a new trial solution on the surface of the spherical boundary. Although SS has shown superior performance over many metaheuristic algorithms. It is still easily to fall into local optimum and has poor convergence accuracy. In this paper, we for the first time propose a hybrid spherical search and sine cosine algorithm aimed to leverage the strengths of two different search mechanisms with a co-evolutionary manner. We use the opposite solution to avoid the blind learning from the current optimal solution, to effectively alleviate the immature convergence of the algorithm. Experiments based on 30 benchmark functions of IEEE CEC2017 are conduced and results demonstrate that the proposed algorithm outperforms other states-of-the-art algorithms.
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.
