.png){kind=icon}
.png){kind=icon}
Return
Efficient State Transition Algorithm With Guaranteed Optimality
.png){kind=icon}
PRE
AI
DOI：10.1109/tsmc.2026.3688256.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The state transition algorithm (STA), as an intelligent optimization method grounded in constructivist learning, has been demonstrated to be highly effective in solving complex optimization problems. However, the standard STA suffers from slow convergence, particularly in the later stages when dealing with flat landscapes. Additionally, users are required to set the maximum number of iterations based on intuition. To address these issues, an enhanced STA with guaranteed optimality is introduced. This improvement involves three key components. First, novel translation transformations (TTs), inspired by predictive modeling, are developed to generate a broader set of candidate solutions by leveraging historical data. Second, adaptive parameter control strategies are incorporated to accelerate convergence. Finally, a dedicated termination condition is designed to ensure that the algorithm converges at the optimal solution, analogous to the zero gradient condition in mathematical programming. The comprehensive experimental results validate the effectiveness and superiority of the proposed method. The source codes for ESTA and EXSTA will be publicly available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/tiezhongyu2005/ESTA</uri>
Keywords:
Constructivist learning
guaranteed optimality
intelligent optimization
state transition algorithm (STA)
termination condition
Journal
I
IF:
8.7
Papers:
76
Citations:
0