2021
DOI: 10.1016/j.asoc.2020.106933
|View full text |Cite
|
Sign up to set email alerts
|

Dimension by dimension dynamic sine cosine algorithm for global optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 37 publications
(6 citation statements)
references
References 58 publications
0
5
0
1
Order By: Relevance
“…Based on a greedy per-dimension update strategy, the evolutionary dimension of solutions will not be overlooked due to degradation in other dimensions, allowing any update value that can improve the solution to be accepted. Ensuring that the algorithm can utilize evolutionary information from individual dimensions for better local search, thereby obtaining higher-quality solutions and improving the convergence speed [36].…”
Section: Fusion Lens Imaging Backward Learning and Dimension-by-dimen...mentioning
confidence: 99%
“…Based on a greedy per-dimension update strategy, the evolutionary dimension of solutions will not be overlooked due to degradation in other dimensions, allowing any update value that can improve the solution to be accepted. Ensuring that the algorithm can utilize evolutionary information from individual dimensions for better local search, thereby obtaining higher-quality solutions and improving the convergence speed [36].…”
Section: Fusion Lens Imaging Backward Learning and Dimension-by-dimen...mentioning
confidence: 99%
“…The results show that the MSCA can perform well over the original SCA and other population-based algorithms. Li et al (2021a) proposed the dimension-by-dimension dynamic SCA (DDSCA) for global optimization problems. In the DDSCA, dimension by dimension strategy is performed by evaluating the solution in each dimension.…”
Section: Sca Based-learning Strategiesmentioning
confidence: 99%
“…Şekil 3. KJS kaba kodu (Singh, 2019), DDSCA (Li, Zhao, & Liu, 2021), HGWO (Zhu, Xu, Li, Wu, & Liu, 2015) ve m-SCA (Gupta & Deep, 2019) algoritmalarıyla da karşılaştırılmıştır. Karşılaştırma literatürde sıklıkla kullanılan 30 boyut için yapılmıştır.…”
Section: Araştırma Sonuçları Ve Tartışmaunclassified