Generalized simulated annealing algorithm and its application to the Thomson model

Y. Xiang; D. Y. Sun; W. Fan; X. G. Gong

doi:10.1016/S0375-9601(97)00474-X

Generalized simulated annealing algorithm and its application to the Thomson model

Y. Xiang^*
, D. Y. Sun
, W. Fan
, X. G. Gong

^*Corresponding author for this work

Chinese Academy of Sciences
China Center of Advanced Science and Technology World Laboratory

Research output: Contribution to journal › Article › peer-review

228 Scopus citations

Abstract

Based on the Tsallis statistics, the generalized simulated annealing algorithm (GSA) is tested and developed. Studies on the Thomson model show that the GSA is more efficient than the classical simulated annealing and the fast simulated annealing. The fluctuation of energy is reduced drastically. The convergence to the global minimum is fast. We believe the GSA algorithm is a powerful method to find the global minimum in more realistic problems, like the equilibrium structure of big clusters.

Original language	English
Pages (from-to)	216-220
Number of pages	5
Journal	Physics Letters, Section A: General, Atomic and Solid State Physics
Volume	233
Issue number	3
DOIs	https://doi.org/10.1016/S0375-9601(97)00474-X
State	Published - 25 Aug 1997
Externally published	Yes

Access to Document

10.1016/S0375-9601(97)00474-X

Cite this

@article{47e5cf90329f48d2a48d2f1f7c1b6ff2,

title = "Generalized simulated annealing algorithm and its application to the Thomson model",

abstract = "Based on the Tsallis statistics, the generalized simulated annealing algorithm (GSA) is tested and developed. Studies on the Thomson model show that the GSA is more efficient than the classical simulated annealing and the fast simulated annealing. The fluctuation of energy is reduced drastically. The convergence to the global minimum is fast. We believe the GSA algorithm is a powerful method to find the global minimum in more realistic problems, like the equilibrium structure of big clusters.",

author = "Y. Xiang and Sun, \{D. Y.\} and W. Fan and Gong, \{X. G.\}",

year = "1997",

month = aug,

day = "25",

doi = "10.1016/S0375-9601(97)00474-X",

language = "英语",

volume = "233",

pages = "216--220",

journal = "Physics Letters, Section A: General, Atomic and Solid State Physics",

issn = "0375-9601",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Generalized simulated annealing algorithm and its application to the Thomson model

AU - Xiang, Y.

AU - Sun, D. Y.

AU - Fan, W.

AU - Gong, X. G.

PY - 1997/8/25

Y1 - 1997/8/25

N2 - Based on the Tsallis statistics, the generalized simulated annealing algorithm (GSA) is tested and developed. Studies on the Thomson model show that the GSA is more efficient than the classical simulated annealing and the fast simulated annealing. The fluctuation of energy is reduced drastically. The convergence to the global minimum is fast. We believe the GSA algorithm is a powerful method to find the global minimum in more realistic problems, like the equilibrium structure of big clusters.

AB - Based on the Tsallis statistics, the generalized simulated annealing algorithm (GSA) is tested and developed. Studies on the Thomson model show that the GSA is more efficient than the classical simulated annealing and the fast simulated annealing. The fluctuation of energy is reduced drastically. The convergence to the global minimum is fast. We believe the GSA algorithm is a powerful method to find the global minimum in more realistic problems, like the equilibrium structure of big clusters.

UR - https://www.scopus.com/pages/publications/0000158812

U2 - 10.1016/S0375-9601(97)00474-X

DO - 10.1016/S0375-9601(97)00474-X

M3 - 文章

AN - SCOPUS:0000158812

SN - 0375-9601

VL - 233

SP - 216

EP - 220

JO - Physics Letters, Section A: General, Atomic and Solid State Physics

JF - Physics Letters, Section A: General, Atomic and Solid State Physics

IS - 3

ER -

Generalized simulated annealing algorithm and its application to the Thomson model

Abstract

Access to Document

Other files and links

Fingerprint

Cite this