ArticleScientific reports2025
An enhanced seasons optimization algorithm for numerical optimization and engineering design.
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 1 paper.
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
1 citing paper in PubMed.
- Secant Optimization Algorithm for efficient global optimization.Scientific reports · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
This paper introduces an Enhanced Seasons Optimization (ESO) algorithm that significantly enhances the search performance and solution quality of the standard Seasons Optimization (SO) algorithm. The SO shows promising results for numerical and engineering optimization tasks, but has weaknesses in balancing exploitation and exploration, resulting in suboptimal solutions and premature convergence. To address these limitations, the ESO incorporates four key innovations: (i) a root spreading operator which enhances local exploitation, (ii) a wildfire operator that enhances the diversity of population, (iii) refined competition and resistance operators that strengthen solution quality and convergence performance, and (iv) opposition-based learning to avoid local optimums. The effectiveness of the ESO algorithm is examined through a comparative analysis against a diverse set of counterpart optimizers, including foundational and highly cited algorithms (PSO, DE), top-performing algorithms (CMAES, LSHES, RRTO, ALA, THRO), and novel nature-inspired algorithms (SO, HO, CBKA). The set of benchmarks comprises 25 numerical optimization functions and 4 engineering design problems. Statistical results demonstrate that the ESO significantly outperforms the original SO algorithm and exhibits competitive or superior performance compared to the counterpart optimizers regarding convergence performance and solution quality. Our key findings include: (i) ESO is the top-performing algorithm in 16 out of 25 of the numerical functions and 3 out of 4 engineering design problems; (ii) it achieved an average ranking of 3.68 in the Friedman test on all numerical benchmarks, outperforming all counterpart algorithms in solving numerical benchmarks; Meanwhile, the second-ranked THRO algorithm attains the average ranking of 4.5 on all functions; (iii) ESO generated the best results in shifted and composite numerical functions, and (iv) it obtained the best performance in the scalability analysis test on 1000-dimensional numerical problems.
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.