Stiffened Composite Panel Design Based on Improved genetic algorithm for the design of stiffened composite panels, by Nagendra, Jestin, Gurdal, Haftka,

Slides:



Advertisements
Similar presentations
Genetic Algorithms Genetic algorithms imitate natural optimization process, natural selection in evolution. Developed by John Holland at the University.
Advertisements

Exact and heuristics algorithms
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
A PARALLEL GENETIC ALGORITHM FOR SOLVING THE SCHOOL TIME TABLING PROBLEM SUMALATHA.
The Use of Linkage Learning in Genetic Algorithms By David Newman.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Evolutionary Computational Intelligence
Introduction to Genetic Algorithms Yonatan Shichel.
Evolutionary Design By: Dianna Fox and Dan Morris.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Local Search and Stochastic Algorithms
1 Genetic Algorithms. CS 561, Session 26 2 The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Combining materials for composite-material cars Ford initiated research at a time when they took a look at making cars from composite materials. Graphite-epoxy.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
Genetic Algorithms Genetic algorithms imitate natural optimization process, natural selection in evolution. Developed by John Holland at the University.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
HOW TO MAKE A TIMETABLE USING GENETIC ALGORITHMS Introduction with an example.
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
1 Combinatorial Problem. 2 Graph Partition Undirected graph G=(V,E) V=V1  V2, V1  V2=  minimize the number of edges connect V1 and V2.
Genetic algorithms (GA) for clustering Pasi Fränti Clustering Methods: Part 2e Speech and Image Processing Unit School of Computing University of Eastern.
Aerospace and Ocean Engineering Department A New Scheme for The Optimum Design of Stiffened Composite Panels with Geometric Imperfections By M. A. Elseifi.
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Genetic Algorithms Abhishek Sharma Piyush Gupta Department of Instrumentation & Control.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5: Power of Heuristic; non- conventional search.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Genetic Algorithms. Overview “A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Algorithms for clustering problem Pasi Fränti
AN OPTIMIZATION DESIGN OF ARTIFICIAL HIP STEM BY GENETIC ALGORITHM AND PATTERN CLASSIFICATION.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Introduction to Genetic Algorithms
Using GA’s to Solve Problems
Genetic Algorithms.
Dr. Kenneth Stanley September 11, 2006
Introduction to Genetic Algorithm (GA)
Genetic Algorithms CPSC 212 Spring 2004.
CS621: Artificial Intelligence
Modified Crossover Operator Approach for Evolutionary Optimization
Genetic algorithms: case study
Steady state Selection
Population Based Metaheuristics
GA.
Presentation transcript:

Stiffened Composite Panel Design Based on Improved genetic algorithm for the design of stiffened composite panels, by Nagendra, Jestin, Gurdal, Haftka, and Watson, Computers and Structures, pp , Standard genetic algorithm did not work well enough even with simplified structural model (finite strip). Algorithm was improved based on simplified version of the panel design problem (e.g. fixed blade height, single laminate).

Geometry and loading

Modeling in PASCO Finite strip model assume that in one direction we can use sine solution, while in the other the displacement can have general shape. Panel Analysis and sizing code (Stroud and Anderson) based on analysis code by Wittrick and Williams.

Optimization problem

Optimization formulation

Material properties Todays graphite-epoxys can do much better.

Genetic code

Selection and Crossover Rank based fitness and roulette wheel selection. Original crossover is a 2-point crossover applied to entire genome. Two children produced. Improved crossover applied individually to each of the three substrings. Crossover applied with 95% probability. If not, first parent copied into next generation.

Mutations Mutation applied to one child with each gene mutated with 3% probability to random new gene. Improved mutation separates orientation mutations from deletion and addition mutations. Stack deletion: First select randomly skin or blade. Then stack closest to mid-plane deleted with Probability of 2-3%. Stack addition: Skin or blade selected randomly, then random stack added at mid-plane. New: Permutation, intra-laminar swap, inter-laminar swap.

Results with original GA What is the main difference between rounded continuous optimum and GA design?

Tuning the algorithm

Improved GA designs What is different?

Comparison