Age-Based Population Dynamics in Evolutionary Algorithms Lisa Guntly.

Slides:



Advertisements
Similar presentations
Empirical Algorithmics Reading Group Oct 11, 2007 Tuning Search Algorithms for Real-World Applications: A Regression Tree Based Approach by Thomas Bartz-Beielstein.
Advertisements

Advanced Mate Selection in Evolutionary Algorithms.
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
1 Evolutionary Computational Inteliigence Lecture 6b: Towards Parameter Control Ferrante Neri University of Jyväskylä.
Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Biologically Inspired Computing: Selection and Reproduction Schemes This is DWC’s lecture three `Biologically Inspired Computing’
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Population Sizing as an Emergent Behavior Jason Cook.
Cooperative Behavior & Path Planning for Autonomous Robots Lakshmanan Meyyappan (Laks)
Introduction to Genetic Algorithms Yonatan Shichel.
The Tools of Demography and Population Dynamics
Introduction to Evolutionary Computation  Genetic algorithms are inspired by the biological processes of reproduction and natural selection. Natural selection.
Optimizing the State Eval Heuristic of Abalone using Evolutionary Algorithms Benjamin Rhew November 28, 2005.
Torcs Simulator Presented by Galina Volkinshtein and Evgenia Dubrovsky.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computational Intelligence Lecture 9: Noisy Fitness Ferrante Neri University of Jyväskylä.
EC Awards Lecture ~ Spring 2008 Advances in Parameterless Evolutionary Algorithms Lisa Guntly André Nwamba Research Advisor: Dr. Daniel Tauritz Natural.
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.
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?
Differential Evolution Hossein Talebi Hassan Nikoo 1.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Pawel Drozdowski – November Introduction GA basics Solving simple problem GA more advanced topics Solving complex problem Question and Answers.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
Genetic Algorithm.
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
Neural and Evolutionary Computing - Lecture 10 1 Parallel and Distributed Models in Evolutionary Computing  Motivation  Parallelization models  Distributed.
Genetic algorithms Prof Kang Li
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
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.
Computational Complexity Jang, HaYoung BioIntelligence Lab.
Artificial Intelligence Chapter 4. Machine Evolution.
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
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.
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.
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.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Practical Issues: Selection.
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.
Contribution of second order evolution to evolutionary algorithms Virginie LEFORT July 11 th.
FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.
Selection Methods Choosing the individuals in the population that will create offspring for the next generation. Richard P. Simpson.
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.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
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 Algorithms Author: A.E. Eiben and J.E. Smith
Genetic Algorithms.
Bulgarian Academy of Sciences
Artificial Intelligence Chapter 4. Machine Evolution
رایانش تکاملی evolutionary computing
Parameter control Chapter 8.
Artificial Intelligence Chapter 4. Machine Evolution
Parameter control Chapter 8.
Beyond Classical Search
Parameter control Chapter 8.
Coevolutionary Automated Software Correction
Presentation transcript:

Age-Based Population Dynamics in Evolutionary Algorithms Lisa Guntly

Motivation Parameter specification complicates EAs Optimal parameter values can change during a run Age is an important factor in Biology

The Importance of Age Age significantly impacts survival in natural populations

Methods Survival chance ( S i ) of an individual is based on age and fitness Main Equation S i  F i F B S AGE Fitness of i Best Fitness

Survival Chance from Age Age is tracked by individual, and is incremented every generation Two equations explored for S AGE Equation 1 (ABPS-AutoEA1): linear decrease S AGE  1  R A ( ) Rate of decrease from age

Survival Chance from Age (cont’d) Equation 2 (ABPS-AutoEA2): more dynamic S AGE  1  N AG 2P  AGE 2G Number of individuals in the same age group Population size Number of generations the EA will run

Survival Chance from Age (cont’d) Effects of –More individuals of the same age will decrease their survival chance –Age will decrease survival chance relative to the maximum age (G) N AG SiSi S AGE  1  N AG 2P  AGE 2G

Experimental Setup Testing done on TSP (size 20/40/80) Offspring size is constant Compared to a manually tuned EA Examine effects of –Initial population size –Offspring size Tracked population statistics –Size –Average age

Performance Results - TSP size 20 Average over 30 runs ABPS-AutoEA1 - ABPS-AutoEA2 -

Performance Results - TSP size 40 Average over 30 runs ABPS-AutoEA1 - ABPS-AutoEA2 -

Initial Population Size Effect 3 different runs

Tracking Population Size and Average Age Same single run

Equation with Fitness Scaling Attempt to fix the lack of selection pressure from fitness New Main Equation S i   F i F B  F W F W S AGE S i  F i F B S Fitness of i Best Fitness Worst Fitness Fitness Scaling

Initial Performance Analysis from Fitness Scaling Equation Average over 30 runs using

Initial Performance Analysis from Fitness Scaling Equation (cont’d) Elitism improved performance slightly Roulette wheel (fitness proportional) parent selection improved performance on a larger TSPs but performed worse on smaller TSPs Independence from initial population size was maintained Adjustment of population size during the run was improved

Future Work Further exploration of fitness scaling methods Test on additional problems Compare to other dynamic population sizing schemes Implement age-based offspring sizing

Questions?