Abstract
Cluster geometry optimization is an important problem from the Chemistry area. Hybrid approaches combining evolutionary algorithms and gradient-driven local search methods are one of the most efficient techniques to perform a meaningful exploration of the solution space to ensure the discovery of low energy geometries. Here we performa comprehensive study on the locality properties of this approach to gain insight to the algorithm’s strengths andweaknesses.Theanalysis is accomplished through the application of several static measures to randomly generated solutions in order to establish the main properties of an extended set of mutation and crossover operators. Locality analysis is complemented with additional results obtained from optimization runs. The combination of the outcomes allows us to propose a robust hybrid algorithm that is able to quickly discover the arrangement of the cluster’s particles that correspond to optimal or near-optimal solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. E. Jones. On the Determination of Molecular Fields. II. From the Equation of State of a Gas. Proc. Roy. Soc. A, 106, 463–477, 1924
J. E. Lennard-Jones. Cohesion. Proc. Phys. Soc., 43, 461–482, 1931
P. Morse. Diatomic Molecules According to the Wave Mechanics. II. Vibrational Levels. Phys. Rev., 34, 57–64, 1929
J. P. K. Doye, R. Leary, M. Locatelli and F. Schoen. Global Optimization of Morse Clusters by Potential Energy Transformations, Informs Journal on Computing, 16, 371–379, 2004
R. L. Johnston. Evolving Better Nanoparticles: Genetic Algorithms for Optimising Cluster Geometries, Dalton Transactions, 22, 4193–4207, 2003
D. M. Deaven and K. Ho. Molecular Geometry Optimization with a Genetic Algorithm, Phys. Rev. Lett. 75, 288–291, 1995
B. Hartke. Global Geometry Optimization of Atomic and molecular Clusters by Genetic Algorithms, In L. Spector et al. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), 1284–1291
B. Hartke. Application of Evolutionary Algorithms to Global Cluster Geometry Optimization, In R. L. Johnston (Ed.), Applications of Evolutionary Computation in Chemistry, Structure and Bonding, 110, 33–53, 2004
F. Manby, R. L. Johnston and C. Roberts. Predatory Genetic Algorithms. Commun. Math. Comput. Chem. 38, 111–122, 1998
W. Pullan. An Unbiased Population-Based Search for the Geometry Optimization of Lennard-Jones Clusters: 2≤N≤372. Journal of Computational Chemistry, 6(9), 899–906, 2005
C. Roberts, R. L. Johnston and N. Wilson (2000). A Genetic Algorithm for the Structural Optimization of Morse Clusters. Theor. Chem. Acc., 104, 123–130, 2000
Y. Zeiri. Prediction of the Lowest Energy Structure of Clusters Using a Genetic Algorithm, Phys. Rev., 51, 2769–2772, 1995
J. Gottlieb and C. Eckert. A Comparison of Two Representations for the Fixed Charge Transportation Problem, In M. Schoenauer et al. (Eds.), Parallel Problem Solving from Nature (PPSN VI), 345–354, Spinger-Verlag LNCS, 2000
J. Gottlieb and G. Raidl. Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem, In C. Fonlupt et al. (Eds.), Artificial Evolution: Fourth European Conference, 38–52, Springer-Verlag LNCS, 1999
G. Raidl and J. Gottlieb. Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem. Evolutionary Computation, 13(4), 441–475, 2005
F. Rothlauf and D. Goldberg, Prüfernumbers and Genetic Algorithms: A Lesson on Hoe the Low Locality on an Encoding Can Harm the Performance of Gas, In M. Schoeneauer et al. (Eds.), Parallel Problem Solving from Nature PPSN VI, 395–404, 2000
F. Rothlauf. On the Locality of Representations, In E. Cantú-Paz et al. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), Part II, 1608–1609, 2003
B. Sendhoff, M. Kreutz and W. Seelen. A Condition for the Genotype-Phenotype Mapping: Causality. In T. Bäck (Ed.), Proceedings of the 7th International Conference on Genetic Algorithms (ICGA-97), 73–80, 1997
F. B. Pereira, J. M. C. Marques, T. Leitão, J. Tavares. Analysis of Locality in Hybrid Evolutionary Cluster Optimization. In G. Yen et al. (Eds.), Proceedings of the IEEE Congress on Evolutionary Computation (CEC-2006), pp. 8049–8056, 2006
J. P. K. Doye and D. J. Wales. Structural Consequences of the Range of the Interatomic Potential. A Menagerie of Clusters. J. Chem. Soc. Faraday Trans. 93, 4233–4243, 1997
D. J. Wales et al. The Cambridge Cluster Database, URL: http://www-wales.ch.cam.ac.uk/CCD.html, accessed on January 2007
D. C. Liu and J. Nocedal. On the Limited Memory Method for Large Scale Optimization, Mathematical Programming B, 45, 503–528, 1989
J. Nocedal. Large Scale Unconstrained Optimization, In A. Watson and I. Duff (Eds.), The State of the Art in Numerical Analysis, 311–338, 1997
S. Wright. The Roles of Mutation, Inbreeding, Crossbreeding and Selection in Evolution. In Proceedings of the 6th International Conference on Genetics, Vol. 1, 356–366, 1932
T. Jones and S. Forrest. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In L. Eshelman (Ed.), Proceedings of the 6th International Conference on Genetic Algorithms (ICGA-95), 184–192, 1995
P. Merz. Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. Ph.D. Thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany, 2000
E. D. Weinberger. Correlated and Uncorrelated Fitness Landscapes and How to Tell the Difference, Biological Cybernetics, 63, 325–336, 1990
W. Hart, T. Kammeyer, R. Belew. The Role of Development in Genetic Algorithms. In D. Whitley and M. Vose, (Eds.), Foundations of Genetic Algorithms 3, Morgan Kaufmann, pp. 315–332, 1995
D. Thierens, D. Goldberg. Mixing in Genetic Algorithms. In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-93), Morgan Kaufmann, pp. 38–45, 1993
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pereira, F., Marques, J., Leitão, T., Tavares, J. (2007). Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality. In: Siarry, P., Michalewicz, Z. (eds) Advances in Metaheuristics for Hard Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72960-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-72960-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72959-4
Online ISBN: 978-3-540-72960-0
eBook Packages: Computer ScienceComputer Science (R0)