Whale optimization and sine-cosine optimization algorithms with cellular topology for parameter identification of chaotic systems and Schottky barrier diode models


Turgut M. S. , Sagban H. M. , Turgut O. E. , Ozmen O. T.

SOFT COMPUTING, 2020 (SCI İndekslerine Giren Dergi) identifier identifier

Özet

This research study aims to enhance the optimization accuracy of the two recently emerged metaheuristics of whale and sine-cosine optimizers by means of the balanced improvements in intensification and diversification phases of the algorithms provided by cellular automata (CA). Stagnation at the early phases of the iterations, which leads to entrapment in local optimum points in the search space, is one of the inherent drawbacks of the metaheuristic algorithms. As a favorable solution alternative to this problem, different types of cellular topologies are implemented into these two algorithms with a view to ameliorating their search mechanisms. Exploitation of the fertile areas in the search domain is maintained by the interaction between the topological neighbors, whereas the improved exploration is resulted from the smooth diffusion of the available population information among the structured neighbors. Numerical experiments have been carried out to assess the optimization performance of the proposed cellular-based algorithms. Optimization benchmark problems comprised of unimodal and multimodal test functions have been applied and numerical results have been compared with those found by some of the state-of-the-art literature optimizers including particle swarm optimization, differential evolution, artificial cooperative search and differential search. Cellular variants have been outperformed by the base algorithms for multimodal benchmark problems of Levy and Penalized1 functions. Then, the proposed cellular algorithms have been applied to two different parameter identification cases in order to test their efficiencies on real-world optimization problems. Extensive performance evaluations on different parameter optimization cases reveal that incorporating the CA concepts on these algorithms not only improves the optimization accuracy but also provides considerable robustness to acquired solutions.