A probabilistic simplified sine cosine crow search algorithm for global optimization problems

Crow Search Algorithm (CSA) is a novel meta-heuristic optimizer that is based on the intelligent behavior of crows. There is rather simple with two adjustable parameters only, which in turn makes it very attractive for applications in different engineering areas. To compensate for the blindness of t...

Full description

Saved in:
Bibliographic Details
Published inEngineering with computers Vol. 39; no. 3; pp. 1823 - 1841
Main Authors Rao, Yundi, He, Dengxu, Qu, Liangdong
Format Journal Article
LanguageEnglish
Published London Springer London 01.06.2023
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0177-0667
1435-5663
DOI10.1007/s00366-021-01578-2

Cover

More Information
Summary:Crow Search Algorithm (CSA) is a novel meta-heuristic optimizer that is based on the intelligent behavior of crows. There is rather simple with two adjustable parameters only, which in turn makes it very attractive for applications in different engineering areas. To compensate for the blindness of the location update perceived in CSA when being tracked, this paper introduces a probability simplified sine cosine algorithm to form a new hybrid algorithm called PSCCSA (Probabilistic Simplified Sine Cosine Crow Search Algorithm). In 16 well-known standard test functions, the proposed algorithm was compared with 5 meta-heuristic algorithms for evaluating the effectiveness of the algorithms (Crow Search Algorithm, standard Sine Cosine Algorithm, Probability Simplified Sine Cosine Algorithm, Multi-Verse Optimizer and Particle Swarm Optimization). In addition, PSCCSA has also been used to solve four classic engineering problems (pressure vessel design, speed reducer design, welded beam design and tension/compression spring design problem). The results show that the proposed algorithm is feasible and effective.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0177-0667
1435-5663
DOI:10.1007/s00366-021-01578-2