Abstract
The sine cosine algorithm (SCA) is widely recognized for its efficacy in solving optimization problems, although it encounters challenges in striking a balance between exploration and exploitation. To improve these limitations, a novel model, termed the novel sine cosine algorithm (nSCA), is introduced. In this advanced model, the roulette wheel selection (RWS) mechanism and opposition-based learning (OBL) techniques are integrated to augment its global optimization capabilities. A meticulous evaluation of nSCA performance has been carried out in comparison with state-of-the-art optimization algorithms, including multi-verse optimizer (MVO), salp swarm algorithm (SSA), moth-flame optimization (MFO), grasshopper optimization algorithm (GOA), and whale optimization algorithm (WOA), in addition to the original SCA. This comparative analysis was conducted across a wide array of 23 classical test functions and 29 CEC2017 benchmark functions, thereby facilitating a comprehensive assessment. Further validation of nSCA utility has been achieved through its deployment in five distinct engineering optimization case studies. Its effectiveness and relevance in addressing real-world optimization issues have thus been emphasized. Across all conducted tests and practical applications, nSCA was found to outperform its competitors consistently, furnishing more effective solutions to both theoretical and applied optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computational Intelligence 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.