论文标题
LCLS-II光注射器的多目标优化方法的比较
Comparison of Multiobjective Optimization Methods for the LCLS-II Photoinjector
论文作者
论文摘要
粒子加速器是世界上一些最大的科学实验之一,可以由数千个具有各种输入范围的组件组成。在设计和操作研究期间,这些系统很容易成为笨拙的优化问题。从2000年代初开始,寻找更好的光束动态配置成为加速器物理社区中启发式优化方法的代名词。遗传算法和粒子群优化目前是最广泛使用的。这些算法可以进行数千个模拟评估,以找到一个机器原型的最佳解决方案。对于大型设施,例如Linac Coolent Light Source(LCLS)和其他设施,这相当于对许多可能的设计配置的有限探索。在本文中,使用三种优化算法优化了LCLS-II PhotoInjector。所有优化都是从均匀的随机和拉丁超立方体样本开始的。在所有情况下,优化始于拉丁超立方体样品的表现优化始于均匀样品。所有三种算法都能够优化光注射器,基于模型的方法在较少的仿真评估中近似于帕累托正面。这项工作与先前的优化观察结合,表明客观惩罚对此类方法的效率有很大的影响。通常,当有关目标空间的信息可用时,我们建议使用启发式方法进行初始优化和基于模型的方法。
Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.