An improved Escape algorithm with multi-strategy enhancement for solving global optimum problems

Clicks: 38
ID: 326757
2026
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #20 of 44 articles by views in journal of computational design and engineering

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Abstract The Escape algorithm (ESC), which simulates crowd evacuation behavior, is a novel algorithm. However, it has certain limitations in terms of convergence speed and the avoidance of local optima. This paper proposes a multi-strategy enhanced variant (ESCSA) which introduces three key improvements: First, it incorporates a dynamic mask probability adjustment mechanism that adapts the dimension update ratio throughout the iteration process, thereby achieving a better balance between exploration and exploitation. Second, it incorporates stagnation detection and Simulated Annealing local search. When the optimal solution shows no significant improvement over several consecutive iterations, the Simulated Annealing optimization mechanism is triggered to generate Gaussian-perturbed neighboring solutions, avoiding local optima via the Metropolis criterion. Third, it implements a worst-elimination strategy, periodically injecting randomly positioned new individuals to replace the worst solutions in the population, thereby maintaining diversity. On the CEC 2017 benchmark suite (10/30/50/100 dimensions), ESCSA achieved the best overall performance among 11 algorithms, ranking first in the Friedman mean rank test across all four dimensions with average ranks of 2.217, 1.383, 1.400, and 1.933, respectively. It obtained the optimal mean fitness on 17, 22, 21, and 17 functions for the four dimensions, respectively. In three engineering design problems (speed reducer design, multi-disc clutch braking, and rolling element bearing design), ESCSA ranked second, third, and first, respectively, demonstrating strong and consistent performance across constrained optimization tasks. When subsequently applied to path planning for mobile robots in static environments, ESCSA was experimentally confirmed to plan robot paths and identify superior solutions efficiently.
Reference Key
openalex_W7204466833 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Ming Wang, Qipeng Chen, Silei Fan, Ning Yu, Junqiang Zheng
Are you one of these authors? Claim your profile
Journal journal of computational design and engineering
Year 2026
DOI
10.1093/jcde/qwag076
URL
https://doi.org/10.1093/jcde/qwag076
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.