EUVIMEDEUVIMED entdecken
Crossref

Efficient State Transition Algorithm With Guaranteed Optimality

Xiaojun Zhou, Chunhua Yang, Weihua Gui, Tingwen Huang

IEEE Transactions on Systems, Man, and Cybernetics: Systems · 2026-08 · 56 (8) · 4786-4798

DOI: 10.1109/tsmc.2026.3688256 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2026-08. Verfasst von Xiaojun Zhou und 3 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Yunnan Fundamental Research Projects.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 https://github.com/tiezhongyu2005/ESTA

Förderung

  • National Natural Science Foundation of China
  • Yunnan Fundamental Research Projects

Zitieren

APA

Zhou, X., Yang, C., Gui, W., & Huang, T. (2026). Efficient State Transition Algorithm With Guaranteed Optimality. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 56(8), 4786-4798. https://doi.org/10.1109/tsmc.2026.3688256

Vancouver

Zhou X, Yang C, Gui W, Huang T. Efficient State Transition Algorithm With Guaranteed Optimality. IEEE Transactions on Systems, Man, and Cybernetics: Systems. 2026;56(8):4786-4798. doi:10.1109/tsmc.2026.3688256

BibTeX
@article{Zhou2026,
  author = {Zhou, Xiaojun and Yang, Chunhua and Gui, Weihua and Huang, Tingwen},
  title = {Efficient State Transition Algorithm With Guaranteed Optimality},
  journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
  year = {2026},
  volume = {56},
  number = {8},
  pages = {4786--4798},
  doi = {10.1109/tsmc.2026.3688256}
}
Kostenlos starten →