PGA:基于遗传算子的新粒子群优化算法,用于集群的全局优化

IF 3.4 3区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY
Kai Wang
{"title":"PGA:基于遗传算子的新粒子群优化算法,用于集群的全局优化","authors":"Kai Wang","doi":"10.1002/jcc.27481","DOIUrl":null,"url":null,"abstract":"<p>We have developed a global optimization program named PGA based on particle swarm optimization algorithm coupled with genetic operators for the structures of atomic clusters. The effectiveness and efficiency of the PGA program can be demonstrated by efficiently obtaining the tetrahedral Au<sub>20</sub> and double-ring tubular B<sub>20</sub>, and identifying the ground state <span></span><math>\n <mrow>\n <msubsup>\n <mtext>ZrSi</mtext>\n <mrow>\n <mn>17</mn>\n <mo>–</mo>\n <mn>20</mn>\n </mrow>\n <mo>−</mo>\n </msubsup>\n </mrow></math> clusters through the comparison between the simulated and the experimental photoelectron spectra (PESs). Then, the PGA was applied to search for the global minimum structures of <span></span><math>\n <mrow>\n <msubsup>\n <mi>Mg</mi>\n <mi>n</mi>\n <mo>−</mo>\n </msubsup>\n </mrow></math> (<i>n</i> = 3–30) clusters, new structures have been found for sizes <i>n</i> = 6, 7, 12, 14, and medium-sized 21–30 were first determined. The high consistency between the simulated spectra and the experimental ones once again demonstrates the efficiency of the PGA program. Based on the ground-state structures of these <span></span><math>\n <mrow>\n <msubsup>\n <mi>Mg</mi>\n <mi>n</mi>\n <mo>−</mo>\n </msubsup>\n </mrow></math> (<i>n</i> = 3–30) clusters, their structural evolution and electronic properties were subsequently explored. The performance on Au<sub>20</sub>, B<sub>20</sub>, <span></span><math>\n <mrow>\n <msubsup>\n <mtext>ZrSi</mtext>\n <mrow>\n <mn>17</mn>\n <mo>–</mo>\n <mn>20</mn>\n </mrow>\n <mo>−</mo>\n </msubsup>\n </mrow></math>, and <span></span><math>\n <mrow>\n <msubsup>\n <mi>Mg</mi>\n <mi>n</mi>\n <mo>−</mo>\n </msubsup>\n </mrow></math> (<i>n</i> = 3–30) clusters indicates the promising potential of the PGA program for exploring the global minima of other clusters. The code is available for free upon request.</p>","PeriodicalId":188,"journal":{"name":"Journal of Computational Chemistry","volume":"45 32","pages":"2764-2770"},"PeriodicalIF":3.4000,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PGA: A new particle swarm optimization algorithm based on genetic operators for the global optimization of clusters\",\"authors\":\"Kai Wang\",\"doi\":\"10.1002/jcc.27481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We have developed a global optimization program named PGA based on particle swarm optimization algorithm coupled with genetic operators for the structures of atomic clusters. The effectiveness and efficiency of the PGA program can be demonstrated by efficiently obtaining the tetrahedral Au<sub>20</sub> and double-ring tubular B<sub>20</sub>, and identifying the ground state <span></span><math>\\n <mrow>\\n <msubsup>\\n <mtext>ZrSi</mtext>\\n <mrow>\\n <mn>17</mn>\\n <mo>–</mo>\\n <mn>20</mn>\\n </mrow>\\n <mo>−</mo>\\n </msubsup>\\n </mrow></math> clusters through the comparison between the simulated and the experimental photoelectron spectra (PESs). Then, the PGA was applied to search for the global minimum structures of <span></span><math>\\n <mrow>\\n <msubsup>\\n <mi>Mg</mi>\\n <mi>n</mi>\\n <mo>−</mo>\\n </msubsup>\\n </mrow></math> (<i>n</i> = 3–30) clusters, new structures have been found for sizes <i>n</i> = 6, 7, 12, 14, and medium-sized 21–30 were first determined. The high consistency between the simulated spectra and the experimental ones once again demonstrates the efficiency of the PGA program. Based on the ground-state structures of these <span></span><math>\\n <mrow>\\n <msubsup>\\n <mi>Mg</mi>\\n <mi>n</mi>\\n <mo>−</mo>\\n </msubsup>\\n </mrow></math> (<i>n</i> = 3–30) clusters, their structural evolution and electronic properties were subsequently explored. The performance on Au<sub>20</sub>, B<sub>20</sub>, <span></span><math>\\n <mrow>\\n <msubsup>\\n <mtext>ZrSi</mtext>\\n <mrow>\\n <mn>17</mn>\\n <mo>–</mo>\\n <mn>20</mn>\\n </mrow>\\n <mo>−</mo>\\n </msubsup>\\n </mrow></math>, and <span></span><math>\\n <mrow>\\n <msubsup>\\n <mi>Mg</mi>\\n <mi>n</mi>\\n <mo>−</mo>\\n </msubsup>\\n </mrow></math> (<i>n</i> = 3–30) clusters indicates the promising potential of the PGA program for exploring the global minima of other clusters. The code is available for free upon request.</p>\",\"PeriodicalId\":188,\"journal\":{\"name\":\"Journal of Computational Chemistry\",\"volume\":\"45 32\",\"pages\":\"2764-2770\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcc.27481\",\"RegionNum\":3,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Chemistry","FirstCategoryId":"92","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcc.27481","RegionNum":3,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

我们开发了一种名为 PGA 的全局优化程序,它基于粒子群优化算法和遗传算子,用于原子团簇结构的优化。通过模拟和实验光电子能谱(PES)的对比,我们有效地得到了四面体 Au20 和双环管状 B20,并识别了基态原子团簇,从而证明了 PGA 程序的有效性和高效性。然后,应用 PGA 寻找(n = 3-30)簇的全局最小结构,发现了 n = 6、7、12、14 和中等大小的 21-30 簇的新结构。模拟光谱与实验光谱的高度一致性再次证明了 PGA 程序的高效性。根据这些(n = 3-30)团簇的基态结构,随后对它们的结构演化和电子特性进行了探索。在 Au20、B20 和 (n = 3-30) 簇上的表现表明,PGA 程序在探索其他簇的全局最小值方面具有巨大潜力。该代码可应要求免费提供。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PGA: A new particle swarm optimization algorithm based on genetic operators for the global optimization of clusters

We have developed a global optimization program named PGA based on particle swarm optimization algorithm coupled with genetic operators for the structures of atomic clusters. The effectiveness and efficiency of the PGA program can be demonstrated by efficiently obtaining the tetrahedral Au20 and double-ring tubular B20, and identifying the ground state ZrSi 17 20 clusters through the comparison between the simulated and the experimental photoelectron spectra (PESs). Then, the PGA was applied to search for the global minimum structures of Mg n (n = 3–30) clusters, new structures have been found for sizes n = 6, 7, 12, 14, and medium-sized 21–30 were first determined. The high consistency between the simulated spectra and the experimental ones once again demonstrates the efficiency of the PGA program. Based on the ground-state structures of these Mg n (n = 3–30) clusters, their structural evolution and electronic properties were subsequently explored. The performance on Au20, B20, ZrSi 17 20 , and Mg n (n = 3–30) clusters indicates the promising potential of the PGA program for exploring the global minima of other clusters. The code is available for free upon request.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.60
自引率
3.30%
发文量
247
审稿时长
1.7 months
期刊介绍: This distinguished journal publishes articles concerned with all aspects of computational chemistry: analytical, biological, inorganic, organic, physical, and materials. The Journal of Computational Chemistry presents original research, contemporary developments in theory and methodology, and state-of-the-art applications. Computational areas that are featured in the journal include ab initio and semiempirical quantum mechanics, density functional theory, molecular mechanics, molecular dynamics, statistical mechanics, cheminformatics, biomolecular structure prediction, molecular design, and bioinformatics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信