Efficient State Transition Algorithm With Guaranteed Optimality
针对标准状态转移算法收敛慢、需凭直觉设迭代次数的问题，提出一种改进算法，通过新平移变换、自适应参数控制和专用终止条件，保证收敛到最优解，实验验证了有效性。
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>