Unbiased geometry optimisation of Morse atomic clusters

W. Pullan
{"title":"Unbiased geometry optimisation of Morse atomic clusters","authors":"W. Pullan","doi":"10.1109/CEC.2010.5586213","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"362 1","pages":"1-7"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2010.5586213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
莫尔斯原子团簇的无偏几何优化
本文给出了用无偏总体搜索(PBS)优化莫尔斯原子团簇的结果。PBS能够重复获得在5≤N≤80,N = 147,ρ = 3,6,10,14范围内的Morse簇的所有假定的全局最小值,如剑桥簇数据库中报道的那样。此外,在81≤N≤146,ρ = 14范围内建立了摩尔斯簇的假定全局极小值。PBS算法整合并扩展了过去十年中在其他集群优化算法中开发的关键技术。特别重要的是使用剪切和粘贴操作符,结构小生境和一个新的操作符,定向优化,它扩展了以前的定向突变的概念。此外,PBS能够以并行模式运行,以优化更大的集群。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Step-Size Individualization: a Case Study for The Fish School Search Family A Genetic Ant Colony Optimization Algorithm for Inter-domain Path Computation problem under the Domain Uniqueness constraint A Simulated IMO-DRSA Approach for Cognitive Reduction in Multiobjective Financial Portfolio Interactive Optimization Applying Never-Ending Learning (NEL) Principles to Build a Gene Ontology (GO) Biocurator Many Layer Transfer Learning Genetic Algorithm (MLTLGA): a New Evolutionary Transfer Learning Approach Applied To Pneumonia Classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1