ArticleScientific reports2025
Multi scenario chaotic transient search optimization algorithm for global optimization technique.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
4 citing papers in PubMed.
- A hybrid metaheuristic framework for robust photovoltaic model parameter estimation based on crested porcupine and differential evolution algorithms.Scientific reports · 2026Article
- A Chaos-Enhanced Binary Newton-Raphson Optimizer for High-Dimensional Sensor Data Feature Selection.Sensors (Basel, Switzerland) · 2026Article
- Quantum-enhanced privacy aggregation for healthcare monitoring in wireless body area networks.Scientific reports · 2026Article
- Chaotic enhanced leader slime mold algorithm for dome structures with frequency constraints.Scientific reports · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.