• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种用于演化簇结构的球割拼接交叉。

A sphere-cut-splice crossover for the evolution of cluster structures.

机构信息

State Key Laboratory of Superlattices and Microstructures, Institute of Semiconductors, Chinese Academy of Sciences, P.O. Box 912, Beijing 100083, People's Republic of China.

出版信息

J Chem Phys. 2013 Jun 7;138(21):214303. doi: 10.1063/1.4807091.

DOI:10.1063/1.4807091
PMID:23758367
Abstract

A new crossover operator is proposed to evolve the structures of the atomic clusters. It uses a sphere rather than a plane to cut and splice the parent structures. The child cluster is constructed by the atoms of one parent which lie inside the sphere, and the atoms of the other parent which lie outside the sphere. It can reliably produce reasonable offspring and preserve the good schemata in parent structures, avoiding the drawbacks of the classical plane-cut-splice crossover in the global searching ability and the local optimization speed. Results of Lennard-Jones clusters (30 ≤ N ≤ 500) show that at the same settings the genetic algorithm with the sphere-cut-splice crossover exhibits better performance than the one with the plane-cut-splice crossover. The average number of local minimizations needed to find the global minima and the average number of energy evaluation of each local minimization in the sphere scheme is 0.8075 and 0.8386 of that in the plane scheme, respectively. The mean speed-up ratio for the entire testing clusters reaches 1.8207. Moreover, the sphere scheme is particularly suitable for large clusters and the mean speed-up ratio reaches 2.3520 for the clusters with 110 ≤ N ≤ 500. The comparison with other successful methods in previous studies also demonstrates its good performance. Finally, a further analysis is presented on the statistical features of the cutting sphere and a modified strategy that reduces the probability of using tiny and large spheres exhibits better global search.

摘要

提出了一种新的交叉算子来演化原子团簇的结构。它使用球体而不是平面来切割和拼接父结构。子簇由位于球体内部的一个父结构中的原子和位于球体外部的另一个父结构中的原子构成。它可以可靠地产生合理的后代,并保留父结构中的良好模式,避免经典的平面切割拼接交叉在全局搜索能力和局部优化速度方面的缺点。 Lennard-Jones 团簇(30≤N≤500)的结果表明,在相同的设置下,带有球切割拼接交叉的遗传算法比带有平面切割拼接交叉的遗传算法性能更好。在球体方案中,找到全局最小值所需的局部最小化的平均数量和每个局部最小化的能量评估的平均数量分别为平面方案的 0.8075 和 0.8386。整个测试团簇的平均加速比达到 1.8207。此外,球体方案特别适用于大型团簇,对于 110≤N≤500 的团簇,平均加速比达到 2.3520。与之前研究中其他成功方法的比较也证明了它的良好性能。最后,对切割球体的统计特征进行了进一步分析,并提出了一种减少使用小球体和大球体概率的改进策略,该策略表现出更好的全局搜索能力。

相似文献

1
A sphere-cut-splice crossover for the evolution of cluster structures.一种用于演化簇结构的球割拼接交叉。
J Chem Phys. 2013 Jun 7;138(21):214303. doi: 10.1063/1.4807091.
2
PDECO: parallel differential evolution for clusters optimization.PDECO:用于聚类优化的并行差分进化。
J Comput Chem. 2013 May 5;34(12):1046-59. doi: 10.1002/jcc.23235. Epub 2013 Mar 9.
3
An unbiased population-based search for the geometry optimization of Lennard-Jones clusters: 2 < or = N < or = 372.基于无偏群体的 Lennard-Jones 团簇几何优化搜索:2 ≤ N ≤ 372
J Comput Chem. 2005 Jul 15;26(9):899-906. doi: 10.1002/jcc.20226.
4
Clever and efficient method for searching optimal geometries of lennard-jones clusters.搜索 Lennard-Jones 团簇最优几何结构的巧妙且高效的方法。
J Chem Inf Model. 2006 Sep-Oct;46(5):2066-70. doi: 10.1021/ci600206k.
5
Geometry optimization of atomic clusters using a heuristic method with dynamic lattice searching.使用具有动态晶格搜索的启发式方法对原子团簇进行几何优化。
J Phys Chem A. 2011 May 26;115(20):5021-6. doi: 10.1021/jp110620x. Epub 2011 Apr 28.
6
Global optimization of binary Lennard-Jones clusters using three perturbation operators.使用三个微扰算子对二元 Lennard-Jones 团簇进行全局优化。
J Chem Inf Model. 2011 Mar 28;51(3):572-7. doi: 10.1021/ci1004256. Epub 2011 Feb 18.
7
Novel method for geometry optimization of molecular clusters: application to benzene clusters.分子簇几何优化的新方法:应用于苯簇
J Chem Inf Model. 2007 Jan-Feb;47(1):104-9. doi: 10.1021/ci600336p.
8
A dynamic lattice searching method for fast optimization of Lennard-Jones clusters.一种用于快速优化 Lennard-Jones 团簇的动态晶格搜索方法。
J Comput Chem. 2004 Nov 15;25(14):1693-8. doi: 10.1002/jcc.20096.
9
A strategy to find minimal energy nanocluster structures.寻找最小能量纳米团簇结构的策略。
J Comput Chem. 2013 Nov 5;34(29):2548-56. doi: 10.1002/jcc.23419. Epub 2013 Aug 26.
10
A New Genetic Algorithm Approach Applied to Atomic and Molecular Cluster Studies.一种应用于原子和分子团簇研究的新型遗传算法方法。
Front Chem. 2019 Nov 5;7:707. doi: 10.3389/fchem.2019.00707. eCollection 2019.

引用本文的文献

1
A New Genetic Algorithm Approach Applied to Atomic and Molecular Cluster Studies.一种应用于原子和分子团簇研究的新型遗传算法方法。
Front Chem. 2019 Nov 5;7:707. doi: 10.3389/fchem.2019.00707. eCollection 2019.
2
A genetic algorithm survey on closed-shell atomic nitrogen clusters employing a quantum chemical approach.采用量子化学方法对闭壳层原子氮团簇的遗传算法研究。
J Mol Model. 2018 Jul 7;24(8):196. doi: 10.1007/s00894-018-3724-6.
3
Minimum Vertex-type Sequence Indexing for Clusters on Square Lattice.最小顶点类型序列索引在正方形格子上的聚类。
Sci Rep. 2017 Mar 24;7(1):392. doi: 10.1038/s41598-017-00398-z.