Charles L. Karr Rodney Bowersox Vishnu Singh

Slides:



Advertisements
Similar presentations
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Advertisements

Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.
CHAPTER 9 E VOLUTIONARY C OMPUTATION I : G ENETIC A LGORITHMS Organization of chapter in ISSO –Introduction and history –Coding of  –Standard GA operations.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Mechanics of Genetic Programming
Hybridization of Search Meta-Heuristics Bob Buehler.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Two-Dimensional Channel Coding Scheme for MCTF- Based Scalable Video Coding IEEE TRANSACTIONS ON MULTIMEDIA,VOL. 9,NO. 1,JANUARY Yu Wang, Student.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Tutorial 4 (Lecture 12) Remainder from lecture 10: The implicit fitness sharing method Exercises – any solutions? Questions?
Genetic Programming.
Genetic Algorithm.
Efficient Model Selection for Support Vector Machines
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Chapter 7 Handling Constraints
Genetic Algorithms Michael J. Watts
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
Distributed Genetic Algorithms with a New Sharing Approach in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANABE Doshisha.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Computational Complexity Jang, HaYoung BioIntelligence Lab.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem Sang-Moon Soak Speaker: 洪嘉涓、陳麗徽、李振宇、黃怡靜.
DYNAMIC FACILITY LAYOUT : GENETIC ALGORITHM BASED MODEL
1 Genetic Algorithms and Ant Colony Optimisation.
Genetic Algorithms Czech Technical University in Prague, Faculty of Electrical Engineering Ondřej Vaněk, Agent Technology Center ZUI 2011.
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Improving the Genetic Algorithm Performance in Aerial Spray Deposition Management University of Georgia L. Wu, W.D. Potter, K. Rasheed USDA Forest Service.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
A Production Scheduling Problem Using Genetic Algorithm Presented by: Ken Johnson R. Knosala, T. Wal Silesian Technical University, Konarskiego Gliwice,
Heterogeneous redundancy optimization for multi-state series-parallel systems subject to common cause failures Chun-yang Li, Xun Chen, Xiao-shan Yi, Jun-youg.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Introduction to genetic algorithm
Optimization Of Robot Motion Planning Using Genetic Algorithm
Evolution Strategies Evolutionary Programming
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Bulgarian Academy of Sciences
C.-S. Shieh, EC, KUAS, Taiwan
Example: Applying EC to the TSP Problem
An evolutionary approach to solving complex problems
Advanced Artificial Intelligence Evolutionary Search Algorithm
Example: Applying EC to the TSP Problem
Example: Applying EC to the TSP Problem
○ Hisashi Shimosaka (Doshisha University)
EE368 Soft Computing Genetic Algorithms.
Presentation transcript:

Charles L. Karr Rodney Bowersox Vishnu Singh Minimization of Sonic Boom on Supersonic Aircraft Using an Evolutionary Algorithm Charles L. Karr Rodney Bowersox Vishnu Singh

Introduction Things that we are going to cover. What is GA? The Problem at hand? How GA is used to solve it. How good is the solution. Conclusion.

Evolutionary algorithms search algorithms based on the mechanics of natural selection growing in popularity (genetic algorithms, evolutionary strategies, evolutionary programming, etc.) effective in complex, nonlinear problems developed to the point of “cookbook” application? still require some expert tuning: “flavors” of crossover and mutation operators – dynamic genetic algorithm

The GA Start Initialize a Population of Strings Evaluate Each String’s Fitness Value Select the Superior Strings for Reproduction Apply Crossover Methods 1….N Apply a Mutation Operator Termination Stop Criterion

The Problem Minimization of Sonic Boom The development of supersonic transport vehicles will require much work in sonic boom mitigation Numerous approaches have been considered (pulse detonation, keel design, etc) Here, we are interested in designing a spike or keel that will mitigate the sonic boom

Changing the Area Distribution The Keel Basically, adding a keel will change the area distribution This change in area distribution will change the ground signature of the aircraft

Ground Signatures

In Real Life

Like With Any EA Application… There are two fundamental issues: Coding How do I represent the problem as a string of characters so that the EA can operate on them Fitness Function How do I determine how good a proposed solution really is

Coding We have to represent an area distribution Fit third or higher order polynomials through five different sections Constraints Continuous through the second derivatives Twenty four (24) coefficients to be determined

Equations The five different sections are represented by the equations shown below We want to determine the coefficients

Coefficients Now to find the Values of the first four coefficients we use the following method. Lets consider The above equations can be written in a matrix form as

Coefficients (continued) Now using matrix inversion method we can find the values of the coefficients By using the other equations and applying the same method the remaining coefficients can be found.

The Strings These strings are basically floating point arrays. X1 X2 … Y1 Y2 Y 3 … Xo … 1.1349 1.1555 0.2367 -1.2976 0.3356 -1.1369 4.3459 C1 … C18 These strings are basically floating point arrays. They represent the different values of X,Y and Y` which are needed to fully describe an area distribution. They will be operated on by the evolutionary algorithm (dynamic GA)

Fitness Function How good is a potential solution Given an area distribution, can we come up with a representation of the effectiveness of the solution It turns out that this is a two-step process: Use a modified version of Whitham’s theory to generate the near field pressure signature Compute the ground signature using NFBOOM, an atmospheric propagation code Compute the magnitude of the sonic boom

Whitham’s Theory IT WORKS!!! Comparison of Quasi-Linear Theory with the Frontal Spike (r = 50.8 cm) Data of Swigart [11]. IT WORKS!!!

GA Particulars GA Parameters Population size = 50 Number of generations = 250 Selection scheme = tournament selection Crossover schemes= ArithXover, Heuristic Xover, SimpleXover Mutation schemes = Uniform, Gaussian, Random

Feasibility Study Compare to a known solution “Best” solution for this aircraft was 106.3 dB The genetic algorithm found a solution of 104.0 for the given conditions

Conclusions This is a preliminary study The initial results are promising Next step is to develop a design tool