Abstract
This contribution focuses upon the application of evolutionary algorithms to the nondeterministic polynomial hard problem of global cluster geometry optimization. The first years of method development in this area are sketched briefly; followed by a characterization of the current state of the art by an overview of recent application work. Strengths and weaknesses of this approach are highlighted by comparison with alternative methods. Last but not least, current method development trends and desirable future development directions are summarized.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
About this chapter
Cite this chapter
Hartke, B. Application of Evolutionary Algorithms to Global Cluster Geometry Optimization. In: Johnston, R.L. (eds) Applications of Evolutionary Computation in Chemistry. Structure and Bonding, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/b13932
Download citation
DOI: https://doi.org/10.1007/b13932
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40258-9
Online ISBN: 978-3-540-44882-2
eBook Packages: Springer Book Archive