Diversity Preservation in Evolutionary Algorithms Jiří Kubalík Intelligent Data Analysis Group Department of Cybernetics CTU Prague.

Slides:



Advertisements
Similar presentations
Logical and Artificial Intelligence in Games Lecture 14
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Biologically Inspired Computing: Operators for Evolutionary Algorithms
CS6800 Advanced Theory of Computation
Evolutionary Computation (EC)
1 Evolutionary Computational Inteliigence Lecture 6b: Towards Parameter Control Ferrante Neri University of Jyväskylä.
CSM6120 Introduction to Intelligent Systems Evolutionary and Genetic Algorithms.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Evolutionary Computing A Practical Introduction Presented by Ben Paechter Napier University with thanks to the EvoNet Training Committee and its “Flying.
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Evolutionary Computational Intelligence
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Symposium “New Directions in Evolutionary Computation” Dr. Daniel Tauritz Director, Natural Computation Laboratory Associate Professor, Department of Computer.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
Problems Premature Convergence Lack of genetic diversity Selection noise or variance Destructive effects of genetic operators Cloning Introns and Bloat.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
L ECTURE 3 Notes are modified from EvoNet Flying Circus slides. Found at: www2.cs.uh.edu/~ceick/ai/EC1.ppt.
Introduction to GAs: Genetic Algorithms How to apply GAs to SNA? Thank you for all pictures and information referred.
Outline Introduction Evolution Strategies Genetic Algorithm
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
Iterative Prototype Optimisation with Evolved Improvement Steps Jiří Kubalík and Jan Faigl Czech Technical University Department of Cybernetics Technicka.
Crossovers and Mutation Richard P. Simpson. Genotype vs. Phenotype The genotype of a chromosome is just the basic data structure (it bits in a binary.
15/06/2003NORPIE 2004, Trondheim1 Genetic Optimization of Electric Machines, a State of the Art Study S. E. Skaar, R. Nilssen.
Niching Genetic Algorithms Motivation The Idea Ecological Meaning Niching Techniques.
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Building an Evolutionary Algorithm Prof. Emma Hart.
Introduction to GAs: Genetic Algorithms Quantitative Analysis: How to make a decision? Thank you for all pictures and information referred.
Genetic Algorithm with Real-coded Binary Rep. 1 GAs and Premature Convergence Premature convergence - GAs converge too early to suboptimal solution  as.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Gerstner Lab, CTU Prague 1Motivation Typically,  an evolutionary optimisation framework considers the EA to be used to evolve a population of candidate.
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.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Genetic Algorithm (Knapsack Problem)
Genetic Algorithms.
CSC 380: Design and Analysis of Algorithms
Artificial Intelligence Project 2 Genetic Algorithms
Process modelling and optimization aid
Genetic Algorithms Chapter 3.
Searching for solutions: Genetic Algorithms
Introduction to Genetic Algorithm and Some Experience Sharing
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
CSC 380: Design and Analysis of Algorithms
Presentation transcript:

Diversity Preservation in Evolutionary Algorithms Jiří Kubalík Intelligent Data Analysis Group Department of Cybernetics CTU Prague

Diversity Preservation in EAs 2 EAs and Premature Convergence Evolutionary cycleHomogeneous population Premature convergence - as the population gets homogeneous, only a little new can be evolved and EA converges to suboptimal solution. Causes of premature convergence:  improper representation and genetic operators, improper selection pressure, insufficient population size, deception

Diversity Preservation in EAs 3 GA with Limited Convergence (GALCO) Motivation  to maintain a diversity of the evolved population and extend the explorative power of the algorithm Realization  Convergence of the population is allowed up to specified extent  Convergence at individual positions of the representation is controlled  Convergence rate specifies a maximal difference in the frequency of ones and zeroes in every column of the population ranges from 0 to PopSize/2  Principal condition at any position of the representation neither ones nor zeroes can exceed the frequency constraint  Specific way of modifying the population genotype

Diversity Preservation in EAs 4 GALCO: Algorithm 1. Generate initial population 2. Choose parents 3. Create offspring 4. if (offspring > parents) then replace parents with offspring else{ find(replacement) replace_with_mask(child1, replacement) find(replacement) replace_with_mask(child2, replacement) } 5. if (not finished) then go to step 2

Diversity Preservation in EAs 5 GALCO: replace_with_mask Mask – vector of integer counters; stores a number of 1s for each bit of the representation 50

Diversity Preservation in EAs 6 Static Test Problems Multimodal problem Deceptive problem Hierarchical problem Royal Road Problem

Diversity Preservation in EAs 7 GALCO: Finding Optimal c multimodal hierarchical royal road deceptive

Diversity Preservation in EAs 8 GALCO: Comparison with SGA multimodal hierarchical royal road deceptive

Diversity Preservation in EAs 9 GALCO: Multimodal Optimization Initial population SIGA with replace_with_mask without

Diversity Preservation in EAs 10 GALCO: Multimodal Optimization (cnd.) Initial populationGALCO SGA

Diversity Preservation in EAs 11 GA with Real-coded Binary Rep. Motivation  using redundant representation, where many different genotypes map to the same phenotype would increase the explorative power of the EA and decrease the probability of getting stuck in a local optimum Realization  real coded binary representation Effect  population can not converge to the homogeneous state so that the premature convergence can not take place

Diversity Preservation in EAs 12 Pseudo-binary representation – binary gene values coded by real numbers from the interval  0.0, 1.0  Example: ch 1 = [ ] ch 2 = [ ] interpretation(ch 1 )=interpretation(ch 2 )=[1001] Gene strength – gene’s stability measure  The closer the real value is to 0.5 the weaker the gene is  „one-valued genes“: 0.92 > 0.86 > 0.65 > 0.62  „zero-valued genes“: 0.07 > 0.19 > 0.23 > 0.41 GARB: Representation

Diversity Preservation in EAs 13 GARB: Gene-strength Adaptation Every offspring gene is adjusted depending on  its interpretation  the relative frequency of ones at given position in the population Vector P[] stores the population statistic Ex.: P[ ]  82% of ones at the first position, 17% of ones at the second position, 35% of ones at the third position, 68% of ones at the fourth position.

Diversity Preservation in EAs 14 GARB: Gene-strength Adaptation cnd. Zero-valued gene: gene’ = gene + c*(1.0-P[i])weakening gene’ = gene – c*P[i]strengthening One-valued gene gene’ = gene + c*(1.0-P[i])strengthening gene’ = gene – c*P[i]weakening  c stands for a maximal gene-adaptation step: c  (0.0,0.2   Gene value interpreted with above-average frequency at given position in the chromosome is weakened, the other one is strengthened.

Diversity Preservation in EAs 15 GARB: Gene-Strength Adaptation cnd. Effect  if some allele begines to prevail in the population, 1. the corresponding genes are weakened in subsequent generations, 2. at some point they are moved to the other side of the threshold 0.5, 3. so that they change their interpretation and the frequency of the allele decreases.  frequency of a given allele is controled by contradictory pressures the convergence to optimal solution pressure and the population diversity preservation pressure

Diversity Preservation in EAs 16 GARB: Boosting-up the Exploitation Genotype of promising solutions should be stabilized for subsequent generations  in order to disable rapid changes in their genotype interpretation Newly generated solutions that are better than their parents  all genes are rescaled (strengthened) - zero-valued genes are set to be close to 0.0 and one-valued genes are set to be close to 1.0 Ex.: ch = (0.71, 0.45, 0.18, 0.57)  ch’= (0.97, 0.03, 0.02, 0.99) Effect  Genes survive with uchanged interpretation through more generations.

Diversity Preservation in EAs 17 GARB: Algorithm 1begin 2initialize(OldPop) 3repeat 4calculate P[] from OldPop 5repeat 6select Parents from OldPop 7generate Children 8adjust Children genes 9evaluate Children 10if Child is better than Parents 11then rescale Child 12insert Children to NewPop 13until NewPop is completed 14switch OldPop and NewPop 15until termination condition 16end

Diversity Preservation in EAs 18 GARB: Results on Static Problems deceptive F101 hierarchical multimodal

Diversity Preservation in EAs 19 Single Gene Diversity Monitoring F101 Hierarchical problem

Diversity Preservation in EAs 20 GARB: Tracking Moving Optimum Moving optimum Population diversity

Diversity Preservation in EAs 21 GARB: Results on Knapsack Problem Oscillating Knapsack Problem  14 objects, w i =2 i, i=0,...,13  f(x)=1/(1+|target - w i x i |)  Target oscillates between two values and 2837, which differ in 9 bits

Diversity Preservation in EAs 22 GARB: Recovering from Homog. State DF3Knapsack problem