Journal
COMPUTER PHYSICS COMMUNICATIONS
Volume 184, Issue 4, Pages 1172-1182Publisher
ELSEVIER
DOI: 10.1016/j.cpc.2012.12.009
Keywords
Crystal structure prediction; Cluster structure prediction; Particle swarm optimization; Evolutionary algorithms; Genetic algorithms; Global optimization; Fingerprint function
Funding
- DARPA [N66001-10-1-4037]
- National Science Foundation [EAR-1114313]
- Rosnauka
- CRDF-Global
- Division Of Earth Sciences
- Directorate For Geosciences [1114313] Funding Source: National Science Foundation
Ask authors/readers for more resources
We present new developments of the evolutionary algorithm USPEX for crystal structure prediction and its adaptation to cluster structure prediction. We show how to generate randomly symmetric structures, and how to introduce 'smart' variation operators, learning about preferable local environments. These and other developments substantially improve the efficiency of the algorithm and allow reliable prediction of structures with up to similar to 200 atoms in the unit cell. We show that an advanced version of the Particle Swarm Optimization (PSO) can be created on the basis of our method, but PSO is strongly outperformed by USPEX. We also show how ideas from metadynamics can be used in the context of evolutionary structure prediction for escaping from local minima. Our cluster structure prediction algorithm, using the ideas initially developed for crystals, also shows excellent performance and outperforms other state-of-the-art algorithms. (c) 2012 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available