Sine–cosine crow search algorithm: theory and applications

In this paper, we propose a new hybrid algorithm called sine–cosine crow search algorithm that inherits advantages of two recently developed algorithms, including crow search algorithm (CSA) and sine–cosine algorithm (SCA). The exploration and exploitation capabilities of the proposed algorithm have...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Neural computing & applications Ročník 32; číslo 12; s. 7725 - 7742
Hlavní autoři: Khalilpourazari, Soheyl, Pasandideh, Seyed Hamid Reza
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer London 01.06.2020
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Data Mining and Knowledge Discovery
Image Processing and Computer Vision
Probability and Statistics in Computer Science
Search algorithms
Soft Computing Techniques: Applications and Challenges
Trigonometric functions
Global optimization
Crow search algorithm
Sine–cosine crow search algorithm
Sine–cosine algorithm
ISSN:0941-0643, 1433-3058
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we propose a new hybrid algorithm called sine–cosine crow search algorithm that inherits advantages of two recently developed algorithms, including crow search algorithm (CSA) and sine–cosine algorithm (SCA). The exploration and exploitation capabilities of the proposed algorithm have significantly improved. Performance of the so-called SCCSA was evaluated in unimodal, multimodal, fixed-dimensional multimodal and composite benchmark functions using robust measures. Based on in-depth analyses and statistical information, we showed that the suggested methodology could provide promising solutions comparing to other state-of-the-art algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-019-04530-0