首页 | 本学科首页   官方微博 | 高级检索  
     


Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters
Authors:Marco Locatelli  Fabio Schoen
Affiliation:(1) Dip. Informatica, Università di Torino, Italy;(2) Dip. Sistemi e Informatica, Università di Firenze, Italy
Abstract:A stochastic global optimization method is applied to the challenging problem of finding the minimum energy conformation of a cluster of identical atoms interacting through the Lennard-Jones potential. The method proposed incorporates within an already existing and quite successful method, monotonic basin hopping, a two-phase local search procedure which is capable of significantly enlarging the basin of attraction of the global optimum. The experiments reported confirm the considerable advantages of this approach, in particular for all those cases which are considered in the literature as the most challenging ones, namely 75, 98, 102 atoms. While being capable of discovering all putative global optima in the range considered, the method proposed improves by more than two orders of magnitude the speed and the percentage of success in finding the global optima of clusters of 75, 98, 102 atoms.
Keywords:global optimization  Lennard-Jones clusters  stochastic algorithms  molecular conformation  monotonic basin hopping  multistart
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号