English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Robustness of 'cut and splice' genetic algorithms in the structural optimization of atomic clusters

MPS-Authors
/persons/resource/persons21532

Froltsov,  Vladimir A.
Theory, Fritz Haber Institute, Max Planck Society;

/persons/resource/persons22000

Reuter,  Karsten
Theory, Fritz Haber Institute, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

0904.1516v1.pdf
(Preprint), 235KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Froltsov, V. A., & Reuter, K. (2009). Robustness of 'cut and splice' genetic algorithms in the structural optimization of atomic clusters. Chemical Physics Letters, 473, 363-366. Retrieved from http://www.fhi-berlin.mpg.de/th/th.html.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-F986-1
Abstract
We return to the geometry optimization problem of Lennard-Jones clusters to analyze the performance dependence of 'cut and splice' genetic algorithms (GAs) on the employed population size. We generally find that admixing twinning mutation moves leads to an improved robustness of the algorithm efficiency with respect to this a priori unknown technical parameter. The resulting very stable performance of the corresponding mutation + mating GA implementation over a wide range of population sizes is an important feature when addressing unknown systems with computationally involved first-principles based GA sampling.