Fitness Uniform Selection Scheme (FUSS) Shane Legg & Marcus Hutter IDSIA, Switzerland Akshat Kumar Indian Institute of Technology.

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

Fitness Uniform Deletion: A Simple Way to Preserve Diversity Shane Legg & Marcus Hutter IDSIA Galleria Manno-Lugano Switzerland.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Genetic Algorithm.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
1 APPENDIX A: TSP SOLVER USING GENETIC ALGORITHM.
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.
Genetic Algorithms Genetic Algorithms (Gas) are inspired by ideas from biological evolution. Like SAs the starting point is a random poor quality solution,
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
(Intro To) Evolutionary Computation Revision Lecture Ata Kaban The University of Birmingham.
1 Optimization problems such as MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP, KNAPSACK, BINPACKING do not have a polynomial.
Evolutionary Computational Intelligence
Introduction to Genetic Algorithms Yonatan Shichel.
1 Traveling Salesman Problem (TSP) Given n £ n positive distance matrix (d ij ) find permutation  on {0,1,2,..,n-1} minimizing  i=0 n-1 d  (i),  (i+1.
Chapter 14 Genetic Algorithms.
Tutorial 4 (Lecture 12) Remainder from lecture 10: The implicit fitness sharing method Exercises – any solutions? Questions?
GAlib A C++ Library of Genetic Algorithm Components Vanessa Herves Gómez Department of Computer Architecture and Technology,
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Genetic Programming.
Genetic Algorithm.
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
Pricing Combinatorial Markets for Tournaments Presented by Rory Kulz.
CS Machine Learning Genetic Algorithms (II).
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
Computational Complexity Jang, HaYoung BioIntelligence Lab.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
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.
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem Sang-Moon Soak Speaker: 洪嘉涓、陳麗徽、李振宇、黃怡靜.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
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. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Genetic Algorithms Chapter Description of Presentations
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
1 Combinatorial Problem. 2 Graph Partition Undirected graph G=(V,E) V=V1  V2, V1  V2=  minimize the number of edges connect V1 and V2.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.
Solving Weakened Cryptanalysis Problems for the Bivium Keystream Generator in the Volunteer Computing Project Oleg Zaikin, Alexander Semenov,
Genetic Algorithms. Solution Search in Problem Space.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Approximation algorithms
Genetic Algorithms Author: A.E. Eiben and J.E. Smith
Genetic Algorithms.
Genetic Algorithms.
Dr. Kenneth Stanley September 11, 2006
Bulgarian Academy of Sciences
Example: Applying EC to the TSP Problem
Artificial Intelligence Project 2 Genetic Algorithms
Lecture 24 NP-Complete Problems
Example: Applying EC to the TSP Problem
Example: Applying EC to the TSP Problem
Multi-Objective Optimization
Genetic Algorithms Chapter 3.
Genetic Algorithms & Simulated Evolution
Steady state Selection
Population Based Metaheuristics
Presentation transcript:

Fitness Uniform Selection Scheme (FUSS) Shane Legg & Marcus Hutter IDSIA, Switzerland Akshat Kumar Indian Institute of Technology

Initial Population

Collapse in Diversity

FUSS

Selection Schemes

FUSS Selection

Properties of FUSS Uses fitness to control population diversity Should be good on problems with many local optima and deep valleys in fitness landscape Doesn't require a similarly metric for the problem to be constructed Problem and representation independent Parameter free (unlike tournament selection etc.) Easy to implement Computationally efficient

Test System Implemented FUSS in Java Steady State GA rather than a Generational GA Used the usual method of random deletion Generations = number of cycles / population size Tested FUSS against Tournament selection Tournament sizes of 2, 5 and 15

Artificial Deceptive Problem Mutation Operator = new random value for the x or y from [0,1] Crossover Operator = x from one parent, y from the other Default mutation and crossover probabilities of 0.5

Random Distance TSP Distance between each pair of cities is random from [0,1] Triangle inequality does not hold in general Deceptive version of TSP but still has some structure Mutation operator = swap position of two cities in the tour Crossover operator = "Partial Match Crossover" 50 runs with 20 cities in each test Population size 5,000

Set Covering Problem NP-complete optimisation problem with real applications Low cost = high fitness Tested against standard benchmark set covering problems Population size = 5,000 Crossover probability = 1.0, Mutation probability = 0.5 Standard mutation and crossover operators = 7 total cost

CNF 3SAT An individual is a set of boolean values for the variables Fitness is the total number of clauses satisfied We used standard benchmark problems for the tests 150 variables, 645 clauses in test problems Mutation = flip state of one boolean variable Crossover = uniform crossover Population size = 10,000 Mutation probability & crossover probability = 0.5

Diversity Under FUSS Total population diversity was high Diversity among fit individuals was poor Can we use the idea of preserving diversity by using fitness values in a more effective way?

Fitness Uniform Deletion Scheme (FUDS) The idea: If we delete an individual which has a unique fitness value we must be losing population diversity If we delete an individual which has a common fitness value we are probably not losing much diversity Thus, dont do random deletion, rather always delete individuals with commonly occurring fitness values. Rather than controlling diversity through selection, control it through deletion, hence FUDS Use a normal selection scheme like tournament selection

Summary Both FUSS and FUDS are: Problem and representation independent Easily implemented and computationally cheap Help maintain total population diversity FUSS has significant problems FUDS has very encouraging results Go to for a technical report on FUDSwww.idsia.ch Maybe other variants on these ideas will work also?