Von Karman Institute for Fluid Dynamics RTO, AVT 167, October, 2009 1 R.A. Van den Braembussche von Karman Institute for Fluid Dynamics Tuning of Optimization.

Slides:



Advertisements
Similar presentations
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advertisements

Logical and Artificial Intelligence in Games Lecture 14
© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Advanced Piloting Cruise Plot.
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
Generative Design in Civil Engineering Using Cellular Automata Rafal Kicinger June 16, 2006.
Chapter 1 The Study of Body Function Image PowerPoint
Subspace Embeddings for the L1 norm with Applications Christian Sohler David Woodruff TU Dortmund IBM Almaden.
Author: Julia Richards and R. Scott Hawley
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
STATISTICS Sampling and Sampling Distributions
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
2010 fotografiert von Jürgen Roßberg © Fr 1 Sa 2 So 3 Mo 4 Di 5 Mi 6 Do 7 Fr 8 Sa 9 So 10 Mo 11 Di 12 Mi 13 Do 14 Fr 15 Sa 16 So 17 Mo 18 Di 19.
ZMQS ZMQS
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
1 STA 536 – Experiments with a Single Factor Regression and ANOVA.
1 The tiling algorithm Learning in feedforward layered networks: the tiling algorithm writed by Marc M é zard and Jean-Pierre Nadal.
Particle Swarm Optimization (PSO)
ABC Technology Project
5-1 Chapter 5 Theory & Problems of Probability & Statistics Murray R. Spiegel Sampling Theory.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Discrete Event (time) Simulation Kenneth.
2 |SharePoint Saturday New York City
VOORBLAD.
15. Oktober Oktober Oktober 2012.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Chapter 6 The Mathematics of Diversification
Copyright © 2013, 2009, 2006 Pearson Education, Inc.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Squares and Square Root WALK. Solve each problem REVIEW:
1..
Optimization 1/33 Radford, A D and Gero J S (1988). Design by Optimization in Architecture, Building, and Construction, Van Nostrand Reinhold, New York.
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Artificial Intelligence
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Januar MDMDFSSMDMDFSSS
Week 1.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Dantzig-Wolfe Decomposition
Intracellular Compartments and Transport
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
Essential Cell Biology
How Cells Obtain Energy from Food
and M-ary Quadrature Amplitude Modulation (M-QAM)
CpSc 3220 Designing a Database
Presentation transcript:

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, R.A. Van den Braembussche von Karman Institute for Fluid Dynamics Tuning of Optimization Strategies

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Improving Convergence of GA Performance Database Geometry GA NS Navier- Stokes Metafunction NS, HT, FEA Predict Learn Requirements Start FEA Stress analysis HT Heat transfer Parallel computing

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Improving Convergence of GA Performance Database Geometry GA NS Navier- Stokes Metafunction NS, HT, FEA Predict Learn Requirements Start FEA Stress analysis HT Heat transfer

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Population size N 2. Substring length l 3. Crossover Probability Pc 4. Mutation Probability Pm 5. Number of children ch Optimal parameter setting ( to accelerate evolution ) Genetic Algorithm Optimal parameter setting

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Genetic Algorithm Optimal parameter setting OF defined by test function Tests on 7 and 27 parameter function GA = non-deterministic Conclusions based on: 5 optimization Result of given effort 5000 OF evaluations Six hump camel back test function

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Genetic Algorithm (1) Population size # evaluations = 5000 = N * t t number of generations N population size Small populations Premature convergence Local optimum Low number of feasible geometries Large populations Low number of generations No evolution 10 < N < 20 Population size

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Genetic Algorithm (2) Substring length l = # of bits / variable 2 l values / variable ε = desired resolution Global minimum Best possible solution average OF x min x max

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, N variables l bits / variable L < 3 too low resolution L > 10 too large design space (slower convergence) Substring length (# of bits) Genetic Algorithm (2) Substring length

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Uniform crossover Swap with probability p c Genetic Algorithm Cross over # of function evaluations Single crossover One random swap / individual

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, p m probability a bit is swapped Mutation probability Total string length ( l.N ) Optimal p m p m =1/( l.n ) p m =2/( l.n ) Genetic Algorithm Mutation mutation Optimal p m ______ p m = 1/(l.N) _ _ _ _ p m = 2/(l.N)

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Genetic Algorithm New generation (n,ch)n best of ch offspring's replace the old population (best individuals can be lost) (n+ch)n best of (ch offspring's + n old population) replace the old population (elitism) (n/i+ch)n/i best contribute to new generation diversity

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Genetic Algorithm Optimal number of children

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Optimization Convergence Performance Database Geometry GA NS Navier- Stokes Metafunction NS, HT, FEA Predict Learn Requirements Start FEA Stress analysis HT Heat transfer

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Metafunction Type (ANN, RBF) Structure (# hidden l) RBF 5 hidden neurons De Jong 2D test function ANN 2 hidden layers 10 hidden neurons Database # of samples Distribution of samples

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Database x x x x Systematic scanning 2 values /variable n variables full factorial 2 n evaluations 7 variables 128 NS evaluations 27 variables 10 7 NS evaluations

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Database merit function merit function objective function m(x) = f(x) - m d m (x)

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Database Alt: Latin Hypercube – Random selection 3 variables 2 values (+ -) / variable 2 3 = 8 combinations 1, 2, 3 and 4 : main effect 5, 6, 7 and 8 : interaction D esign O f E xperiment DOE

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Database Random DOE a168b8c8d 6 parameters Full factorial = 2 6 = 64 Error in 64 points

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Statistical analysis 2 k factorial =64 2 k-2 factorial =16 k=6 Database

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Statistical analysis 2 k-3 factorial = 8 k=6 2 level variables (25% and 75% of non dimensional range) 1 central variable (all variables at 50% of range) 12 to 15 variables 16 runs 16 to 31 variables 32 runs Database

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Metafunction ANN Learning : define W (weight) and b (bias) Navier Stokes results Geometry & bound. cond.

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Metafunction Kriging Linear least square approximation Predicts value and uncertainty Accurate evaluations in regions of high uncertainty Very time consuming

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Metafunction RBF Learning : define W (weight) and b (bias) Gausian activation function

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Multi-objective optimization Convergence

von Karman Institute for Fluid Dynamics RTO, AVT 167, October, Genetic Algorithm Gray coding Gray coding ValueCode Binary coding ValueCode No real advantage observed