2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,

Slides:



Advertisements
Similar presentations
Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Advertisements

CS6800 Advanced Theory of Computation
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Constructing Complex NPC Behavior via Multi- Objective Neuroevolution Jacob Schrum – Risto Miikkulainen –
Elitist Non-dominated Sorting Genetic Algorithm: NSGA-II
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Performance Analysis Using Genesis 1.3 Sven Reiche LCLS Undulator Parameter Workshop Argonne National Laboratory 10/24/03.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Multi-Objective Evolutionary Algorithms Matt D. Johnson April 19, 2007.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Genetic Algorithms in Materials Processing N. Chakraborti Department of Metallurgical & Materials Engineering Indian Institute of Technology Kharagpur.
Design of Autonomous Navigation Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow March 19, 2004.
Torcs Simulator Presented by Galina Volkinshtein and Evgenia Dubrovsky.
1 Autonomous Controller Design for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow North Carolina State University.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Crossover Operation with Different Parents Crossover Operation with Identical Parents.
Applying Multi-Criteria Optimisation to Develop Cognitive Models Peter Lane University of Hertfordshire Fernand Gobet Brunel University.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
Evolutionary Multi-objective Optimization – A Big Picture Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Genetic Algorithm.
Problems Premature Convergence Lack of genetic diversity Selection noise or variance Destructive effects of genetic operators Cloning Introns and Bloat.
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme Intelligent Systems Design Laboratory , Doshisha University , Kyoto Japan.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Comparison of Differential Evolution and Genetic Algorithm in the Design of a 2MW Permanent Magnet Wind Generator A.D.Lilla, M.A.Khan, P.Barendse Department.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
I.V. Bazarov, Multivariate Optimization of High Brightness DC Gun Photoinjector, UCLA Workshop, 8-10 November CHESS / LEPP ERL DC Gun Injector.
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
1 Exploring Custom Instruction Synthesis for Application-Specific Instruction Set Processors with Multiple Design Objectives Lin, Hai Fei, Yunsi ACM/IEEE.
Optimization of the ESRF upgrade lattice lifetime and dynamic aperture using genetic algorithms Nicola Carmignani 11/03/2015.
Distributed Genetic Algorithms with a New Sharing Approach in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANABE Doshisha.
Hybird Evolutionary Multi-objective Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Immune Genetic Algorithms By Jeremy Moreau. References Licheng Jiao, Senior Member, IEEE, and Lei Wang, “A Novel Genetic Algorithm Based on Immunity,”
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
DIVERSITY PRESERVING EVOLUTIONARY MULTI-OBJECTIVE SEARCH Brian Piper1, Hana Chmielewski2, Ranji Ranjithan1,2 1Operations Research 2Civil Engineering.
For Wednesday Read chapter 6, sections 1-3 Homework: –Chapter 4, exercise 1.
For Wednesday Read chapter 5, sections 1-4 Homework: –Chapter 3, exercise 23. Then do the exercise again, but use greedy heuristic search instead of A*
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
Multi-objective Evolutionary Algorithms (for NACST/Seq) summarized by Shin, Soo-Yong.
Tamaki Okuda ● Tomoyuki Hiroyasu   Mitsunori Miki   Shinya Watanabe  
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Multiobjective Optimization  Particularities of multiobjective optimization  Multiobjective.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Evolutionary multi-objective algorithm design issues Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
1 ParadisEO-MOEO for a Bi-objective Flow-Shop Scheduling Problem May 2007 E.-G. Talbi and the ParadisEO team
- Divided Range Multi-Objective Genetic Algorithms -
J. Wu March 06, 2012 ICFA-FLS 2012 Workshop Jefferson Lab, Newport News, VA Tolerances for Seeded Free Electron Lasers FEL and Beam Phys. Dept. (ARD/SLAC),
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
E. Schneidmiller and M. Yurkov FEL Seminar, DESY April 26, 2016 Reverse undulator tapering for polarization control at X-ray FELs.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Genetic algorithms and SIS multi-turn injection
Presented by: Dr Beatriz de la Iglesia
Example: Applying EC to the TSP Problem
Boltzmann Machine (BM) (§6.4)
Local Search Algorithms
Coevolutionary Automated Software Correction
Presentation transcript:

2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar, G. Yu 2/29/2012

An Overview of Multi-Objective Genetic Algorithms Multi-objective optimization –Goal: to find the Pareto optimal set –Traditional approach: Weighted sum of objectives and its variants. –Evolutionary approach: converge to the Pareto front in one run. Genetic algorithms –Manipulate a set of solutions (a population) toward the optimal front with operations that simulate biological evolution. –Three operators Selection – apply the evolution pressure toward the optimal front Crossover – create new solution (child) by combining two solutions (parents) Mutation – alters an existing solution to create a new one. 2/29/20122

Pros and Cons –Obtain global optimum (more likely) despite complexity of the problem. –Optimize multiple objectives simultaneously. –Easy to apply constraints. –But it can be much slower than gradient-based methods. 2/29/20123

4 Domination and the Pareto set

The NSGA-II algorithm NSGA (non-dominated sorting genetic algorithm) -II 2/29/20125 K. Deb, IEEE Transtions On Evolutionary Computation Vol 6, No 2,April 2002 Selection (of parents) Crossover Mutation

NSGA-II with parallel computation Use Matlab script for control and processing –The algorithm is implemented in matlab –Post-processing is in matlab Parallel computation via submitting multiple jobs to a cluster –Use file input/output as communication between external program (Genesis) and matlab. –I/O time limits the average number of nodes in use when computation time is short. 2/29/ min per generation with up to 60 processors, or 4.5 s per evaluation, up from 20 s for individual evaluation. However the speed gain from parallel computing will be much higher for time- dependent runs.

LCLS2 Taper Optimization Undulator tapering is required for LCLS2 to reach TW power because of SASE saturation. Taper profile optimization is critical to capture as many electrons as possible in coherent emission. –Exploration of profile models is necessary. Should phase between undulator segments be included in optimization? 2/29/20127

Taper Models Considered 2/29/20128 Adding phase shift variables to the above models. So far we only varied the first few phase shifts after exponential growth. Focusing scheme Basic 8 variables Cubic 9 variables Quartic 8 variables For

GA setup Objectives: 2 –Power –“Emittance”: beam size x divergence at the exit, a convenient way to introduce diversity Population: 600 Termination condition: about 100 generations or converged. Evolving mutation and crossover probability 2/29/20129

The basic 8 variable model (0118) 2/29/ param eterlowhighdeltabest a z b K r z r z2-z (a, z0)(b, K 0 )(r1, z1)(r2, z2-z1)

The basic 8 variable model with 7 phase shifts (0115b) 2/29/ (a, z0) (b, K 0 ) Introduce phase shifts in gaps following undulators 5 to 11. (r1, z1)(r2, z2-z1) param eterlowhighdeltabest a z b K r z r z2-z

The cubic model (9 variables) (0119) 2/29/ (z0, a1)(a2, a3) (K0, r1)(z1,r2) parame terLowhighdeltabest z a a a K r z r z2-z

The quadratic and quartic model (0112) 2/29/ (a, z0)(b, K 0 ) (r1, z1)(r2, z2-z1)

Summary of time-independent results 2/29/ caseNvargenerationpopulationmax Power inc in 10 gen emittance (um)taper ratio capture ratio ##TW%um% " "basic % %1+a x^b " b " % %from random " b" no phase % " "phase % % based on gen 47, TW " "cubic % %1+a x+b x^2+c x^3 " " % % " " no phase % " "quartic % %1+a x^2 + b x^4

Effects of phase shift variables 2/29/ Based on case Inside undulators, phase rotation and energy loss both change. In the gaps, the two can be decoupled. Can this improve the performance?

Time dependent results with the taper profiles 2/29/ Taper profile slightly shifted (detuned to maximize for average power for the slices) to maintain high power (but not optimized) The three model attain similar power. More study is needed to understand the results.

Time dependent simulation with phase shifts 2/29/ The effects of phase shifts are not conclusive from results we got so far.

Summary All cases without phase shifts converge to solutions with similar beam power and taper ratio, with a capture ratio of about 43%. Phase shifts only slightly increase beam power. But they can considerably change capture ratio (e.g., from 35% to 41%). We will continue the exploration –Other taper profile models –Introduce other objective functions –More time dependent studies 2/29/201218