Unbiased Geometry Optimisation of Morse Atomic Clusters

View/ Open
Author(s)
Pullan, W
Griffith University Author(s)
Year published
2010
Metadata
Show full item recordAbstract
This paper presents the results obtained using an unbiased Population Based Search (PBS) for optimising Morse atomic clusters. PBS is able to repeatedly obtain all putative global minima for Morse clusters in the range 5 = N = 80, N = 147, ? = 3,6,10, 14, as reported in the Cambridge Cluster Database. In addition, putative global minima have been established for Morse clusters in the range 81 = N = 146, ? = 14. The PBS algorithm incorporates and extends key techniques that have been developed in other cluster optimisation algorithms over the last decade. Of particular importance are the use of cut and paste operators, structure ...
View more >This paper presents the results obtained using an unbiased Population Based Search (PBS) for optimising Morse atomic clusters. PBS is able to repeatedly obtain all putative global minima for Morse clusters in the range 5 = N = 80, N = 147, ? = 3,6,10, 14, as reported in the Cambridge Cluster Database. In addition, putative global minima have been established for Morse clusters in the range 81 = N = 146, ? = 14. The PBS algorithm incorporates and extends key techniques that have been developed in other cluster optimisation algorithms over the last decade. Of particular importance are the use of cut and paste operators, structure niching and a new operator, Directed Optimisation, which extends the previous concept of directed mutation. In addition, PBS is able to operate in a parallel mode for optimising larger clusters.
View less >
View more >This paper presents the results obtained using an unbiased Population Based Search (PBS) for optimising Morse atomic clusters. PBS is able to repeatedly obtain all putative global minima for Morse clusters in the range 5 = N = 80, N = 147, ? = 3,6,10, 14, as reported in the Cambridge Cluster Database. In addition, putative global minima have been established for Morse clusters in the range 81 = N = 146, ? = 14. The PBS algorithm incorporates and extends key techniques that have been developed in other cluster optimisation algorithms over the last decade. Of particular importance are the use of cut and paste operators, structure niching and a new operator, Directed Optimisation, which extends the previous concept of directed mutation. In addition, PBS is able to operate in a parallel mode for optimising larger clusters.
View less >
Conference Title
2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
Copyright Statement
© 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Subject
Other information and computing sciences not elsewhere classified