AN OPTIMIZATION DESIGN OF ARTIFICIAL HIP STEM BY GENETIC ALGORITHM AND PATTERN CLASSIFICATION.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

Stiffened Composite Panel Design Based on Improved genetic algorithm for the design of stiffened composite panels, by Nagendra, Jestin, Gurdal, Haftka,
Local Search Algorithms
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Exact and heuristics algorithms
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.5: Local search – Genetic Algorithms.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.
Iterative Improvement Algorithms
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithm for Variable Selection
Genetic Algorithms Learning Machines for knowledge discovery.
Using a Genetic Algorithm for Approximate String Matching on Genetic Code Carrie Mantsch December 5, 2003.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Basic concepts of Data Mining, Clustering and Genetic Algorithms Tsai-Yang Jea Department of Computer Science and Engineering SUNY at Buffalo.
Game of Life Changhyo Yu Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies.
Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
國立陽明大學生資學程 陳虹瑋. Genetic Algorithm Background Fitness function ……. population selection Cross over mutation Fitness values Random cross over.
Genetic Algorithms: A Tutorial
Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
Introduction to Genetic Algorithms and Evolutionary Computation
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri Spss training day
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.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Simulation of Plant Growth using Genetic Algorithms Peter Barber Westminster College.
Fuzzy Genetic Algorithm
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Optimization by Model Fitting Chapter 9 Luke, Essentials of Metaheuristics, 2011 Byung-Hyun Ha R1.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
Othello Artificial Intelligence With Machine Learning Computer Systems TJHSST Nick Sidawy.
A Genetic Algorithm for Designing Materials: Gene A. Tagliarini Edward W. Page M. Rene Surgi.
Genetic Search Algorithms Matt Herbster. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
The Implementation of Genetic Algorithms to Locate Highest Elevation By Harry Beddo.
Overview Last two weeks we looked at evolutionary algorithms.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm(GA)
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Evolutionary Computation Evolving Neural Network Topologies.
Using GA’s to Solve Problems
Some Extra Contents Lecturer : Bijay Mishra. What kind of data preprocessing do we need before applying data mining algorithm to any dataset? Data preprocessing.
FEA Introduction.
Modified Crossover Operator Approach for Evolutionary Optimization
Traveling Salesman Problem by Genetic Algorithm
Coevolutionary Automated Software Correction
Presentation transcript:

AN OPTIMIZATION DESIGN OF ARTIFICIAL HIP STEM BY GENETIC ALGORITHM AND PATTERN CLASSIFICATION

ARTIFICIAL HIP STEM

HISTORY First elaborated in 1961 More than 1,000,000 operations each year worldwide Performance depend on: Stress Displacement Amount of wear Fatigue

ARTIFICIAL HIP STEM

PROBLEMS IN CURRENT DESIGN Design from Boolean operation of basic geometric primitives Design based on experience Can not fit individual needs

DESIGN METHOD Geometry modeling Finite element model Genetic Algorithm Patten classification

GEOMETRY MODELING freeform model represented by B-splines Geometric Models are stored parametrically randomly generate

GEOMETRY MODELING

FEA Finite element model Static analysis Distribution of stresses Displacements SolidWorks Simulation

FEA

DONE BY SOLIDWORKS API (C#)

GENETIC ALGORITHM Components of a Genetic Algorithm Representation of gene Selection Criteria Reproduction Rules

GENETIC ALGORITHM

Step 1: Set up an initial population P(0)—an initial set of solution Evaluate the initial solution for fitness Generation index t=0 Step 2: Use genetic operators to generate the set of children (crossover, mutation) Add a new set of randomly generated population Reevaluate the population—fitness Perform competitive selection—which members will be part of next generation Select population P(t+1)—same number of members If not converged t←t+1 Go To Step 2

PATTEN CLASSIFICATION FEA is very time consuming Eliminate useless data Predict result

IMPLEMENTATION METHOD Solidworks Simulation Matlab Solidworks API C# Integration