首页> 外文期刊>Frontiers in Chemistry >A New Genetic Algorithm Approach Applied to Atomic and Molecular Cluster Studies
【24h】

A New Genetic Algorithm Approach Applied to Atomic and Molecular Cluster Studies

机译:一种新的遗传算法在原子和分子簇研究中的应用

获取原文
       

摘要

A new procedure is suggested to improve genetic algorithms for the prediction of structures of nanoparticles. The strategy focuses on managing the creation of new individuals by evaluating the efficiency of operators (o1, o2, ..., o13) in generating well-adapted offspring. This is done by increasing the creation rate of operators with better performance and decreasing that rate for the ones which poorly fulfill the task of creating favorable new generation. Additionally, several strategies (thirteen at this level of approach) from different optimization techniques were implemented on the actual genetic algorithm. Trials were performed on the general case studies of 26 and 55-atom clusters with binding energy governed by a Lennard-Jones empirical potential with all individuals being created by each of the particular thirteen operators tested. Results show that our management strategy could avoid bad operators, keeping the overall method performance with great confidence. Moreover, amongst the operators taken from the literature and tested herein, the genetic algorithm was faster when the generation of new individuals was carried out by the twist operator, even when compared to commonly used operators such as Deaven and Ho cut-and-splice crossover. Operators typically designed for basin-hopping methodology also performed well on the proposed genetic algorithm scheme.
机译:提出了一种新的程序来改进用于预测纳米颗粒结构的遗传算法。该策略的重点是通过评估操作员(o1,o2,...,o13)产生适应性强的后代的效率来管理新个体的创建。这是通过提高性能更好的运营商的创造率,并降低那些不能很好地完成创造有利的新一代任务的运营商的创造率来实现的。此外,在实际的遗传算法上实施了来自不同优化技术的几种策略(在该方法级别上为13种)。在26个和55个原子团簇的一般案例研究中进行了试验,这些团簇的束缚能由Lennard-Jones经验潜力控制,所有个人都是由所测试的13个操作员中的每一个创建的。结果表明,我们的管理策略可以避免不良操作者,使整个方法的性能充满信心。此外,在取自文献并在此进行过测试的算子中,即使通过与Deaven和Ho剪接交叉等常用算子进行比较,当通过扭曲算子进行新个体的生成时,遗传算法也更快。 。通常为盆地跳跃方法设计的运营商在提出的遗传算法方案上也表现良好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号