Genetic algorithms in application to the geometry optimization of nanoparticles

26Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

Abstract

Applications of genetic algorithms to the global geometry optimization problem of nanoparticles are reviewed. Genetic operations are investigated and importance of phenotype genetic operations, considering the geometry of nanoparticles, are mentioned. Other efficiency improving developments such as floating point representation and local relaxation are described broadly. Parallelization issues are also considered and a recent parallel working single parent Lamarckian genetic algorithm is reviewed with applications on carbon clusters and SiGe core-shell structures. © 2008 by the authors.

Cite

CITATION STYLE

APA

Dugan, N., & Erkoç, Ş. (2009, March). Genetic algorithms in application to the geometry optimization of nanoparticles. Algorithms. https://doi.org/10.3390/a2010410

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free