An Adaptive Chaotic Sine Cosine Algorithm for Constrained and Unconstrained Optimization

Abstract EN

Sine cosine algorithm (SCA) is a new meta-heuristic approach suggested in recent years, which repeats some random steps by choosing the sine or cosine functions to find the global optimum.

SCA has shown strong patterns of randomness in its searching styles.

At the later stage of the algorithm, the drop of diversity of the population leads to locally oriented optimization and lazy convergence when dealing with complex problems.

Therefore, this paper proposes an enriched SCA (ASCA) based on the adaptive parameters and chaotic exploitative strategy to alleviate these shortcomings.

Two mechanisms are introduced into the original SCA.

First, an adaptive transformation parameter is proposed to make transformation more flexible between global search and local exploitation.

Then, the chaotic local search is added to augment the local searching patterns of the algorithm.

The effectiveness of the ASCA is validated on a set of benchmark functions, including unimodal, multimodal, and composition functions by comparing it with several well-known and advanced meta-heuristics.

Simulation results have demonstrated the significant superiority of the ASCA over other peers.

Moreover, three engineering design cases are employed to study the advantage of ASCA when solving constrained optimization tasks.

The experimental results have shown that the improvement of ASCA is beneficial and performs better than other methods in solving these types of problems.