Author: Zhang, Z.
Paper Title Page
TUPAB286 Experience with On-line Optimizers for APS Linac Front End Optimization 2151
 
  • H. Shang, M. Borland, X. Huang, Y. Sun
    ANL, Lemont, Illinois, USA
  • M. Song, Z. Zhang
    SLAC, Menlo Park, California, USA
 
  Funding: * Work supported by U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, under Contract No. DE-AC02-06CH11357 and BES R&D project FWP 2020-ANL-34573
While the APS linac lattice is set up using a model developed with ELEGANT, the thermionic RF gun front end beam dynamics has been difficult to model. One of the issues is that beam properties from the thermionic gun can vary from time to time. As a result, linac front end beam tuning is required to establish good matching and maximize the charge transported through the linac. We have been using a traditional simplex optimizer to find the best settings for the gun front end magnets and steering magnets. However, it takes a long time and requires some fair initial conditions. Therefore, we imported other on-line optimizers, such as robust conjugate direction search (RCDS) which is a classic optimizer as simplex, multi-objective particle swarm (MOPSO), and multi-generation gaussian process optimizer (MG-GPO) which is based on machine learning technique. In this paper we report our experience with these on-line optimizers for maximum bunch charge transportation efficiency through the linac.
 
poster icon Poster TUPAB286 [2.964 MB]  
DOI • reference for this paper ※ https://doi.org/10.18429/JACoW-IPAC2021-TUPAB286  
About • paper received ※ 12 May 2021       paper accepted ※ 08 July 2021       issue date ※ 29 August 2021  
Export • reference for this paper using ※ BibTeX, ※ LaTeX, ※ Text/Word, ※ RIS, ※ EndNote (xml)  
 
WEPAB304 Multi-Objective Multi-Generation Gaussian Process Optimizer 3383
 
  • X. Huang, M. Song, Z. Zhang
    SLAC, Menlo Park, California, USA
 
  Funding: DOE, Office of Science, Office of Basic Energy Sciences, DE-AC02-76SF00515 and FWP 2018-SLAC-100469 Computing Science, Office of Advanced Scientific Computing Research, FWP 2018-SLAC-100469ASCR.
We present a multi-objective evolutionary optimization algorithm that uses Gaussian process (GP) regression-based models to select trial solutions in a multi-generation iterative procedure. In each generation, a surrogate model is constructed for each objective function with the sample data. The models are used to evaluate solutions and to select the ones with a high potential before they are evaluated on the actual system. Since the trial solutions selected by the GP models tend to have better performance than other methods that only rely on random operations, the new algorithm has much higher efficiency in exploring the parameter space. Simulations with multiple test cases show that the new algorithm has a substantially higher convergence speed and stability than NSGA-II, MOPSO, and some other recent preselection-assisted algorithms.
 
DOI • reference for this paper ※ https://doi.org/10.18429/JACoW-IPAC2021-WEPAB304  
About • paper received ※ 17 May 2021       paper accepted ※ 12 July 2021       issue date ※ 28 August 2021  
Export • reference for this paper using ※ BibTeX, ※ LaTeX, ※ Text/Word, ※ RIS, ※ EndNote (xml)  
 
WEPAB305 Teeport: Break the Wall Between the Optimization Algorithms and Problems 3387
 
  • Z. Zhang, X. Huang, M. Song
    SLAC, Menlo Park, California, USA
 
  Funding: DOE, Office of Science, Office of Basic Energy Sciences, DE-AC02-76SF00515 and FWP 2018-SLAC-100469 Computing Science, Office of Advanced Scientific Computing Research, FWP 2018-SLAC-100469ASCR.
Optimization algorithms/techniques such as genetic algorithm (GA), particle swarm optimization (PSO) and Gaussian process (GP) have been widely used in the accelerator field to tackle complex design/online optimization problems. However, connecting the algorithm with the optimization problem can be difficult, sometimes even unrealistic, since the algorithms and problems could be implemented in different languages, might require specific resources, or have physical constraints. We introduce an optimization platform named Teeport that is developed to address the above issue. This real-time communication (RTC) based platform is particularly designed to minimize the effort of integrating the algorithms and problems. Once integrated, the users are granted a rich feature set, such as monitoring, controlling, and benchmarking. Some real-life applications of the platform are also discussed.
 
DOI • reference for this paper ※ https://doi.org/10.18429/JACoW-IPAC2021-WEPAB305  
About • paper received ※ 20 May 2021       paper accepted ※ 02 July 2021       issue date ※ 27 August 2021  
Export • reference for this paper using ※ BibTeX, ※ LaTeX, ※ Text/Word, ※ RIS, ※ EndNote (xml)