.png){kind=icon}
Return
Multi scenario chaotic transient search optimization algorithm for global optimization technique
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-025-86757-7.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, chaotic maps (CMs) have been employed in many optimization algorithms as a motivator to find a better solution to non-convex engineering problems since they can avoid local optima and find the near-optimal solution rapidly. In this article, a metaheuristic, physics-based algorithm called chaotic transient search optimization (CTSO) algorithm is developed to solve 23 benchmark functions, including uni- and multi-modal optimization functions. Nine CMs integrated into the TSO to improve its search capabilities by applying various scenarios for improving the TSO random numbers. Further, the proposed CTSO was compared with the original TSO using the Wilcoxon p-value test, non-parametric sign test, t-test, convergence curves, and elapsed time. Furthermore, the proposed CTSO algorithm has been employed for solving real-life engineering design problems, including coil spring, welded beam, and pressure vessel design, where CTSO performed better than some recent optimization algorithms in finding the best design.
Keywords:
Physics-based optimization algorithms
Transient search optimization
Chaotic maps
Ergodicity
Metaheuristic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
28.3W
Citations:
83.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more