Rationalized Sine Cosine Optimization With Efficient Searching Patterns

Abstract

Even with the advantages of the sine cosine algorithm (SCA) in solving multimodal problems, there are some shortcomings for this method. We observe that the random patterns utilized in SCA cause an increasing attraction toward local optima. This study developed a rationalized version of this technique to deal with several representative benchmark cases with different dimensions. The improved algorithm combines the chaotic local search mechanism and Lévy flight operator with the core trends of SCA. The new variant is named as CLSCA. The Lévy flight with long jumps is adopted to boost the exploratory tendencies of the algorithm, while the chaotic local search mechanism is used as a local search for the destination point, which helps to further enhance the exploitation capability of SCA. Therefore, a suitable equilibrium between the exploration and exploitation can be kept in the CLSCA by two embedded patterns. To investigate the effectiveness and strength of the developed method, the CLSCA was tested on many benchmark functions, including different types of tasks such as single modal, multi-modal, hybrid, and composition functions. We compare the CLSCA with well-known optimizers, like particle swarm optimization (PSO) algorithm, grey wolf optimizer (GWO), SCA with differential evolution (SCADE), opposition-based SCA (OBSCA), fuzzy self-tuning PSO (FST_PSO), chaotic salp swarm algorithm (CSSA), and Chaotic whale optimizer (CWOA). Numerical experimental results demonstrate that the exploratory and exploitative properties of the classical SCA are clearly improved. The experimental results also show that our improved CLSCA is a better technique for different kinds of optimization tasks.

Keywords

• Sine cosine algorithm
• optimization
• chaotic local search
• Lévy flight