EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Practical Issues: Selection.

Slides:



Advertisements
Similar presentations
Biologically Inspired Computing: Operators for Evolutionary Algorithms
Advertisements

CS6800 Advanced Theory of Computation
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
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.
Evolutionary Computational Intelligence
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Genetic Algorithm for Variable Selection
Game of Life Changhyo Yu Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Tutorial 4 (Lecture 12) Remainder from lecture 10: The implicit fitness sharing method Exercises – any solutions? Questions?
Genetic Algorithm.
Computer Implementation of Genetic Algorithm
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
Sampling The sampling errors are: for sample mean
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
AP Statistics Section 7.2 C Rules for Means & Variances.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
90288 – Select a Sample and Make Inferences from Data The Mayor’s Claim.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal
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. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
The Practice of Statistics Third Edition Chapter 7: Random Variables Copyright © 2008 by W. H. Freeman & Company Daniel S. Yates.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Why do GAs work? Symbol alphabet : {0, 1, * } * is a wild card symbol that matches both 0 and 1 A schema is a string with fixed and variable symbols 01*1*
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.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Practical Issues: Representations.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
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.
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
Genetic Algorithms and Evolutionary Programming A Brief Overview.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Artificial Intelligence Project 2 Genetic Algorithms
Boltzmann Machine (BM) (§6.4)
Searching for solutions: Genetic Algorithms
Genetic algorithms: case study
GA.
Presentation transcript:

EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Practical Issues: Selection

‘Roulette’ Problems The basic ‘roulette’ selection, in which each individual is assigned a probability of selection according to their fitness in proportion to total fitness, suffers from a number of problems suppose the fitness varies from e.g. -10 to +10 we could add 10 (or 11), but suppose we don’t know the lower bound of fitness as the solution is nearly reached, all fitnesses will be roughly the same, so have roughly equal chance, e.g. four individuals with x= 29, 29, 30, 30 when maximising x 2 over [0 31] have fitness proportions 0.242, 0.242, 0.258, 0.258

Fitness Scaling A frequently used solution is to ‘scale’ the fitness function in some way Fitness scaling alters (transforms) the fitness in some way, such that the fitness of an average individual is still average below average individuals have low fitness above average individuals have high fitness There are two main methods used linear scaling sigma scaling

Linear Scaling For the population, find the average (mean) fitness the minimum (min) fitness Scale by the equation f min f mean f max

Sigma Scaling For the population, find the average (mean) fitness the standard deviation (std) of fitness Scale by the equation Has a very similar effect to linear scaling, except when there are outliers

Elitism If selection of the next generation is left to chance, then there is always a possibility that the best individual in the population does not survive the GA may ‘wander off’ from a good solution In ‘elitist’ strategies, the best individual always survives to the next generation there are minor variations possible the best individual survives to the next generation and is then is the pool for crossover, mutation, etc. the best individual survives to the next generation and is ‘protected’ from any genetic operators

Overlapping Populations As a further refinement, it is also possible to not replace the entire population at each generation straight overlapping a proportion of the population –e.g. 50% survives unchanged, the other 50% undergo operators elitist overlapping temporarily allow the population size to grow by adding in new individuals (all the old ones remain) the old and the new then ‘fight’ for survival In practice, any variation that you can think of!

Other Selection Mechanisms Proportional selection calculate the fitness proportions as before multiply the fitness proportion by the population size round this to the nearest integer that many of the individual survive Tournament selection to select a new population of size N, from N repeat N times pick two individuals at random from the population the one with the highest fitness survives supposedly mirrors natural competition more closely