Design Optimization School of Engineering University of Bradford 1 A discrete problem Difficultiy in the solution of a discrete problem.

Slides:



Advertisements
Similar presentations
Genetic Algorithms Vida Movahedi November Contents What are Genetic Algorithms? From Biology … Evolution … To Genetic Algorithms Demo.
Advertisements

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Developments on Shape Optimization at CIMNE October Advanced modelling techniques for aerospace SMEs.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Advanced evolutionary algorithms for transonic drag reduction and high lift of 3D configuration using unstructured FEM 21 May
Engineering Optimization
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.
Introduction to Genetic Algorithms Yonatan Shichel.
Design Optimization School of Engineering University of Bradford 1 There is always a need for improvement of products and processes. How? MOTIVATION.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
1 ERIC WHITNEY (USYD) FELIPE GONZALEZ (USYD) Applications to Fluid Inaugural Workshop for FluD Group : 28th Oct AMME Conference Room.
Genetic Algorithm for Variable Selection
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Handling Constraints 報告者 : 王敬育. Many researchers investigated Gas based on floating point representation but the optimization problems they considered.
7/2/2015Intelligent Systems and Soft Computing1 Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
1. Optimization and its necessity. Classes of optimizations problems. Evolutionary optimization. –Historical overview. –How it works?! Several Applications.
Evolutionary Intelligence
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
Genetic Algorithms Genetic algorithms imitate natural optimization process, natural selection in evolution. Developed by John Holland at the University.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri Spss training day
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
S J van Vuuren The application of Genetic Algorithms (GAs) Planning Design and Management of Water Supply Systems.
Multidisciplinary Design Optimisation (MDO)  Different MDO approaches but lack of robust and fast design tools.  Evolutionary/genetic methods perform.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Fuzzy Genetic Algorithm
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
1 Part IV: Blade Geometry Optimization Philippe Giguère Graduate Research Assistant Steady-State Aerodynamics Codes for HAWTs Selig, Tangler, and Giguère.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
 Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms n Introduction, or can evolution be intelligent? n Simulation.
Genetic Algorithms Czech Technical University in Prague, Faculty of Electrical Engineering Ondřej Vaněk, Agent Technology Center ZUI 2011.
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
Heterogeneous redundancy optimization for multi-state series-parallel systems subject to common cause failures Chun-yang Li, Xun Chen, Xiao-shan Yi, Jun-youg.
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
In the name of ALLAH Presented By : Mohsen Shahriari, the student of communication in Sajad institute for higher education.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic Algorithms and Evolutionary Programming A Brief Overview.
Introduction to genetic algorithm
Genetic Algorithms.
Introduction to Genetic Algorithm (GA)
C.-S. Shieh, EC, KUAS, Taiwan
Basics of Genetic Algorithms (MidTerm – only in RED material)
Meta-Heuristic Algorithms 16B1NCI637
Basics of Genetic Algorithms
EE368 Soft Computing Genetic Algorithms.
Presentation transcript:

Design Optimization School of Engineering University of Bradford 1 A discrete problem Difficultiy in the solution of a discrete problem

Design Optimization School of Engineering University of Bradford 2 Example of a discrete problem Optimization of a composite structure where individual parts of it are described by 10 design variables. Each design variable represents a ply angle varying from 0 to 45 degrees with an increment of 5 degrees, i.e. 10 possible angles. One full FE analysis of each design takes 1 sec. on a computer. Question: how much time would it take to check all the combinations of the angles in order to guarantee the optimum solution? MATHEMATICAL OPTIMIZATION PROBLEM

Design Optimization School of Engineering University of Bradford 3 Genetic Algorithm stochastic, directed and highly parallel search technique based on principles of population genetics Difference with traditional search techniques: –Coding of the design variables as opposed to the design variables themselves, allowing both discrete and continuous variables –Works with population of designs as opposed to single design, thus reducing the risk of getting stuck at local minima –Only requires the objective function value, not the derivatives. This aspect makes GAs domain-independent –GA is a probabilistic search method, not deterministic, making the search highly exploitative.

Design Optimization School of Engineering University of Bradford 4 Genetic Algorithm Representation scheme: finite-length binary alphabet of ones and zeros The fitness function defines how well each solution solves the problem objective. Darwin's principle of survival of the fittest: evolution is performed by genetically breeding the population of individuals over a number of generations –crossover combines good information from the parents –mutation prevents premature convergence

Design Optimization School of Engineering University of Bradford 5 Genetic Algorithm Evolutionary mechanism of the Genetic Algorithm

Design Optimization School of Engineering University of Bradford 6 Genetic Algorithm A flowchart of a genetic algorithm

Design Optimization School of Engineering University of Bradford 7 Representation of a design by a binary string. Example. Genetic Algorithm Portal frameChromosome of a design set using binary representation

Design Optimization School of Engineering University of Bradford 8 Genetic Algorithm - Encoded variables for UBs Genetic Algorithm

Design Optimization School of Engineering University of Bradford 9 Genetic Algorithm - Single point crossover Genetic Algorithm

Design Optimization School of Engineering University of Bradford 10 Genetic Algorithm - Arrangement of design variables Genetic Algorithm Five-bay five-storey framework

Design Optimization School of Engineering University of Bradford 11 Genetic Algorithm - Solution for five-bay five-storey framework Genetic Algorithm

Design Optimization School of Engineering University of Bradford 12 Genetic Algorithm Genetic Algorithm - Five-bay five-storey framework (8 d.v.)

Design Optimization School of Engineering University of Bradford 13 Genetic Algorithm Example. Three-bay by four-bay by four-storey structure

Design Optimization School of Engineering University of Bradford 14 Numerical optimization techniques Genetic Algorithm - 3-bay by 4-bay by 4-storey structure Genetic Algorithm

Design Optimization School of Engineering University of Bradford 15 Convergence history for 3-bay by 4-bay by 4-storey structure Genetic Algorithm

Design Optimization School of Engineering University of Bradford 16 Optimization of front wing of J3 Jaguar Racing Formula 1 car APPLICATION OF GENETIC ALGORITHM

Design Optimization School of Engineering University of Bradford 17 Optimization of front wing of J3 Jaguar Racing Formula 1 car APPLICATION OF GENETIC ALGORITHM

Design Optimization School of Engineering University of Bradford 18 Genetic Algorithm APPLICATION OF GENETIC ALGORITHM Front wing of J3 Jaguar Racing Formula 1 car

Design Optimization School of Engineering University of Bradford 19 Genetic Algorithm APPLICATION OF GENETIC ALGORITHM Schematic layup of the composite structure of the wing

Design Optimization School of Engineering University of Bradford 20 APPLICATION OF GENETIC ALGORITHM Optimization problem: minimize mass subject to displacement constraints (FIA and aerodynamics) Result of optimization: Design obtained by GA optimization: 4.95 Kg Baseline design weight: 5.2 Kg Improvement: 4.8%

Design Optimization School of Engineering University of Bradford 21 Optimization of an aerofoil B-spline representation of the NACA 0012 aerofoil. The B-spline poles are numbered from 1 to 25. Design variables: x and y coordinates of 22 B-spline poles (N = 44). EXAMPLES: SHAPE OPTIMIZATION W.A. Wright, C.M.E. Holden, Sowerby Research Centre, British Aerospace (1998)

Design Optimization School of Engineering University of Bradford 22 Problem definition (aerofoil, cont.) EXAMPLES: SHAPE OPTIMIZATION Problem formulation: Objective function (to be minimized): drag coefficient at Mach 0.73 and Mach 0.76: F 0 (x) = 2.0 C d total (M=0.73) C d total (M=0.76) Constraints: on lift and other operational requirements (sufficient space for holding fuel, etc.) Techniques used: –Powell’s Direct Search (PDS) –Genetic Algorithm (GA) –MARS Carren M.E. Holden Sowerby Research Centre, British Aerospace, UK

Design Optimization School of Engineering University of Bradford 23 Results (aerofoil, cont.) EXAMPLES: SHAPE OPTIMIZATION Results of MARS. Initial (dashed) and obtained (solid) configurations

Design Optimization School of Engineering University of Bradford 24 Results (aerofoil, cont.) EXAMPLES: SHAPE OPTIMIZATION Results of GA. Initial (dashed) and obtained (solid) configurations