Computer Science Genetic Algorithms10/13/10 1 An Investigation of Niching and Species Formation in Genetic Function Optimization Kalyanmoy Deb David E.

Slides:



Advertisements
Similar presentations
Genetic Algorithms Chapter 3. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Genetic Algorithms GA Quick Overview Developed: USA in.
Advertisements

Local Search Algorithms
Genetic Algorithms.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Genetic Algorithms By: Jacob Noyes 4/16/2013. Traveling Salesman Problem Given:  A list of cities  Distances between each city Find:  Shortest path.
Genetic Algorithms for Real Parameter Optimization Written by Alden H. Wright Department of Computer Science University of Montana Presented by Tony Morelli.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Computer Science Genetic Algorithms10/10/ A comparative analysis of selection schemes used in genetic algorithms David E. Goldberg Kalyanmoy Deb.
Optimizing genetic algorithm strategies for evolving networks Matthew Berryman.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Evolutionary Computational Inteliigence Lecture 6a: Multimodality.
Multimodal Problems and Spatial Distribution Chapter 9.
Genetic Algorithm for Variable Selection
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Local Search and Stochastic Algorithms
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
Multimodal Optimization (Niching) A/Prof. Xiaodong Li School of Computer Science and IT, RMIT University Melbourne, Australia
MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme Intelligent Systems Design Laboratory , Doshisha University , Kyoto Japan.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic Algorithms Michael J. Watts
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Lecture 5. Niching and Speciation (2) 4 학습목표 진화로 얻어진 해의 다양성을 확보하기 위한 대표 적인 방법에 대해 이해한다.
Omni-Optimizer A Procedure for Single and Multi-objective Optimization Prof. Kalyanmoy Deb and Santosh Tiwari.
2 Fundamentals of Genetic Algorithms Alexandre P. Alves da Silva and Djalma M. Falca˜o.
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 Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Kansas State University Department of Computing and Information Sciences CIS 732: Machine Learning and Pattern Recognition Friday, 16 February 2007 William.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
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.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Parent Selection Strategies for Evolutionary Algorithms A Comparison of Parent Selection Strategies Modeled After Human Social Interaction By Michael Ames.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
1 Effect of Spatial Locality on An Evolutionary Algorithm for Multimodal Optimization EvoNum 2010 Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong Department.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Evolutionary Computing Chapter 5. / 32 Chapter 5: Fitness, Selection and Population Management Selection is second fundamental force for evolutionary.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
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.
Genetic Search Algorithms Matt Herbster. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.
Multimodal Problems and Spatial Distribution A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 9.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Using GA’s to Solve Problems
Genetic Algorithm in TDR System
Dr. Kenneth Stanley September 11, 2006
Evolution Practice Test
Speciation/Niching The original SGA (Simple GA) is designed to rapidly search the landscape (exploration) and zoom in (exploitation) on a single solution.
Kalyanmoy Deb David E. Goldberg
Multimodal Problems and Spatial Distribution
An evolutionary approach to solving complex problems
Multimodal Problems and Spatial Distribution
2 Fundamentals of Genetic Algorithms
Genetic Algorithms Chapter 3.
Multimodal Problems and Spatial Distribution
Lecture 4. Niching and Speciation (1)
Presentation transcript:

Computer Science Genetic Algorithms10/13/10 1 An Investigation of Niching and Species Formation in Genetic Function Optimization Kalyanmoy Deb David E. Goldberg

Computer Science Genetic Algorithms10/13/10 2 What is the paper about? Multimodal function optimization What behavior would be like? –Find and climb the highest peak? –Have members of the population on every peak? How many? How do we get the behavior we want: –Niching –Fitness sharing Conclusions

Computer Science Genetic Algorithms10/13/10 3 Where are we now? DeJong used crowding in 1975 –Create niches by replacing existing strings according to their similarity with other strings in the population When selecting an individual to replace: C_f (crowding factor) individuals are randomly picked from the population and the most genotypically similar to the new individual is replaced Note that only a proportion G (generation gap) of the population reproduces every gen Goldberg and Richardson: Fitness sharing schemes. Share according to similarity in –Genotypic space - bit string space –Phenotypic space – decoded parameter space

Computer Science Genetic Algorithms10/13/10 4 Phenotypic Sharing Sharing function Sh(d): –= 1 – (d/s)^a if d < s –= 0 if d >= s Good results on a couple of functions

Computer Science Genetic Algorithms10/13/10 5 How do we get s in phenotypic space? D can simply be euclidean distance We want s to divide the search space in such a way as to be half the distance between peaks S = (Xmax – Xmin)/2q where q is the number of peaks

Computer Science Genetic Algorithms10/13/10 6 How do we get s in genotypic space? D can simply be hamming distance We want s to divide the search space in such a way as to be half the distance between peaks S = 0.5 (L + z* sqrt(L)) –Z* is the normalized bit difference corresponding to 1/q of the space

Computer Science Genetic Algorithms10/13/10 7 Results (F1)

Computer Science Genetic Algorithms10/13/10 8 Results (F1)

Computer Science Genetic Algorithms10/13/10 9 Results (F2)

Computer Science Genetic Algorithms10/13/10 10 Mating restrictions Crossover produces individuals between peaks Restricting mating

Computer Science Genetic Algorithms10/13/10 11 Results