2020
DOI: 10.1007/s10489-020-01893-z
|View full text |Cite
|
Sign up to set email alerts
|

Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
292
0
2

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 705 publications
(294 citation statements)
references
References 47 publications
0
292
0
2
Order By: Relevance
“…Equation 22 17and (18) to update transfer and density decreasing factor If 5 . 0  Tf then Use equation 20and (21) to update the acceleration and normalization Use equation (22) to update the position else If 5 .…”
Section: Updating Positionmentioning
confidence: 99%
“…Equation 22 17and (18) to update transfer and density decreasing factor If 5 . 0  Tf then Use equation 20and (21) to update the acceleration and normalization Use equation (22) to update the position else If 5 .…”
Section: Updating Positionmentioning
confidence: 99%
“…Real problems are solved more effectively since solutions are not restricted to locally optimal approaches. The metaheuristic algorithms are applied in various fields and proved helpful [8,9,10,11,12].…”
Section: Introductionmentioning
confidence: 99%
“…The metaheuristic algorithms are applied in various fields and proved helpful [9], [10]. Metaheuristics have proved to be useful in various problems, including this one [11]- [13].…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, the No-Free Lunch Theorem [8] states that no specific optimization algorithm can accurately solve multi-ple optimization problems. Thus, several MAs have been developed for use in biomedicine [9], [10], bioinformatics [11], [12], cheminformatics [13], [14], feature selection [15], engineering problems [16], [17], [18], [19], pattern recognition, text clustering [20], [21], and wireless sensor networks [22], [23]. However, all MAs need to balance exploration and exploitation stages; otherwise, solutions tend to become trapped in local optima or cannot properly converge [24], [25].…”
Section: Introductionmentioning
confidence: 99%
“…In addition, Tables (14, TSA-LEO OTSU) and (6, TSA-LEO Kapur) show the optimal thresholds obtained from TSA-LEO and other competitors under the condition of level = 2, 3, 4, and 5 for Otsu and Kapur objective functions. Tables(15,16,17,18, TSA-LEO Otsu) and(7, 8, 9, and 10, TSA-LEO Kapur) represent the fitness, PSNR, SSIM, and SSIM results, for Otsu and Kapur methods respectively. Moreover, Tables (19 and 19) show the results of the Wilcoxon rank-sum test of TSA-LEO and other seven algorithms with Otsu and Kapur methods.…”
mentioning
confidence: 99%