A genetic algorithm for Lennard-Jones atomic clusters

被引:42
作者
Barrón, C [1 ]
Gómez, S
Romero, D
Saavedra, A
机构
[1] Univ Nacl Autonoma Mexico, Fac Ciencias, Mexico City, DF, Mexico
[2] Univ Nacl Autonoma Mexico, IIMAS, Mexico City, DF, Mexico
[3] Univ Nacl Autonoma Mexico, Inst Matemat, Cuernavaca, Morelos, Mexico
[4] UAM Iztapalapa, Dept Matemat, Mexico City, DF, Mexico
关键词
atomic cluster; Lennard-Jones; genetic algorithm; global optimization;
D O I
10.1016/S0893-9659(99)00106-8
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In regard to the problem of determining minimum L-J configurations for clusters of n atoms, we present here a genetic algorithm able to reproduce all best-known solutions in the 13 < n < 147 size range. These include not only the classical structures adhering to the icosahedral-growth, but also seven icosahedral structures with incomplete core, six more following the Marks decahedron geometry, and the unique (n = 38) face-centered cubic configuration that has been found in this range. (C) 1999 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:85 / 90
页数:6
相关论文
共 18 条