ArticleScientific reports2026
An enhanced escape algorithm with comprehensive learning and Cauchy-Gaussian mutation for reservoir optimization.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
Global optimization of complex, high-dimensional landscapes remains a fundamental challenge in scientific and engineering domains. To mitigate the inherent limitations of premature convergence and diversity loss, this paper proposes CLGMESC, an enhanced variant of the Escape Algorithm (ESC). The proposed algorithm integrates a dimension-wise comprehensive learning (CL) strategy with a hybrid Cauchy-Gaussian mutation (HCGM) operator. The CL strategy reconfigures the learning paradigm for stagnant individuals, enabling them to construct exemplars from multiple high-quality peers and thereby restore population diversity. Synergistically, the HCGM operator utilizes an adaptive weighting mechanism to dynamically balance heavy-tailed Cauchy mutations for global exploration and thin-tailed Gaussian mutations for local refinement, effectively facilitating escapes from local optima. Comprehensive evaluations on the CEC2017 benchmark suite demonstrate that CLGMESC achieves the top rank among ten advanced metaheuristics (including SBO, BBO, PO, DE, PSO, SMA, CPA, and MGO), with Wilcoxon signed-rank tests confirming its statistical superiority ([Formula: see text]) across the majority of test functions. Furthermore, the practical efficacy of CLGMESC was validated through a reservoir production optimization problem using the three-dimensional Egg Model ([Formula: see text] grid). In determining optimal well controls, CLGMESC achieved the highest Net Present Value ([Formula: see text] USD) with the lowest standard deviation, thus substantiating its reliability and robustness in solving computationally intensive real-world engineering problems. The consistently high rankings across diverse benchmarks and the substantial economic gains in the reservoir simulation underscore the algorithm's pronounced capability to maintain a robust exploration-exploitation balance and dynamically escape local optima in demanding parameter spaces.
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.