Abstract
A fast annealing evolutionary algorithm was applied to determine the minimum configurations of Lennard-Jones (LJ) clusters. Other techniques such as limited memory quasi-Newton algorithm (L-BFGS), seeding, similarity checking, and moving, were also used in this method. It has been shown that these techniques dramatically speed up the evolutionary procedure. The lowest known energies were located for the LJ clusters containing up to 74 atoms. It has been proven that the algorithm is a fast and high efficient optimizing tool, which can be used in energy minimization problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
