arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.09328cond-mat.mtrl-sciphysics.comp-ph
收藏

遗传算法和模拟退火算法在离散链导热系数最大化中的比较

A Comparison of Genetic Algorithms and Simulated Annealing in Maximizing the Thermal Conductivity of Discrete Massive Chains

Alexander Kerr, Kieran Mullen

摘要:

化学组成的功能是复杂的和离散的性质,使其不可能优化它们的梯度方法。遗传算法,它不使用衍生信息,是用来最大限度地提高从一个固定的图书馆随机产生的分子单元的一维经典谐振子的热导率。遗传算法构建具有没有物理增量的组分的结构的能力在优化具有不相关聚合物单元库的分子中是重要的。将遗传算法与模拟退火算法在该问题中的性能进行了比较。这些例程的超参数是从网格搜索中选择的,以优化其预期的解决方案强度。通过遗传算法找到的解决方案始终优于模拟退火的成本较长的计算机时间。总之,这些算法能够找到热导体候选人,在连续介质中的镜像解决方案。

英文摘要:

Functions of chemical composition are complex and discrete in nature making it impossible to optimize them with gradient methods. Genetic algorithms, which do not use derivative information, are used to maximize the thermal conductivity of one-dimensional classical harmonic oscillators made from a fixed library of randomly generated molecular units. The ability for the genetic algorithm to build structures with components having no physical increment is important in optimizing molecules with a library of unrelated polymer units. The performance of genetic algorithms in this problem is compared with simulated annealing. Hyper-parameters for these routines are selected from a grid search in order to optimize their expected solution strength. The solutions found via the genetic algorithm consistently outperform those of simulated annealing at the cost of longer computer time. Together, these algorithms are able to find thermal conductor candidates that mirror solutions in continuous media.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑