|
|
|
|
LEADER |
01000caa a22002652 4500 |
001 |
NLM11791147X |
003 |
DE-627 |
005 |
20250203044958.0 |
007 |
tu |
008 |
231222s2002 xx ||||| 00| ||eng c |
028 |
5 |
2 |
|a pubmed25n0393.xml
|
035 |
|
|
|a (DE-627)NLM11791147X
|
035 |
|
|
|a (NLM)11908078
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Cai, Wensheng
|e verfasserin
|4 aut
|
245 |
1 |
2 |
|a A fast annealing evolutionary algorithm for global optimization
|
264 |
|
1 |
|c 2002
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
500 |
|
|
|a Date Completed 24.10.2002
|
500 |
|
|
|a Date Revised 03.11.2003
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a By combining the aspect of population in genetic algorithms (GAs) and the simulated annealing algorithm (SAA), a novel algorithm, called fast annealing evolutionary algorithm (FAEA), is proposed. The algorithm is similar to the annealing evolutionary algorithm (AEA), and a very fast annealing technique is adopted for the annealing procedure. By an application of the algorithm to the optimization of test functions and a comparison of the algorithm with other stochastic optimization methods, it is shown that the algorithm is a highly efficient optimization method. It was also applied in optimization of Lennard-Jones clusters and compared with other methods in this study. The results indicate that the algorithm is a good tool for the energy minimization problem
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Shao, Xueguang
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t Journal of computational chemistry
|d 1984
|g 23(2002), 4 vom: 22. März, Seite 427-35
|w (DE-627)NLM098138448
|x 0192-8651
|7 nnns
|
773 |
1 |
8 |
|g volume:23
|g year:2002
|g number:4
|g day:22
|g month:03
|g pages:427-35
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 23
|j 2002
|e 4
|b 22
|c 03
|h 427-35
|