Download presentation

Presentation is loading. Please wait.

Published byJennifer MacLeod Modified over 4 years ago

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

2
Initial Population

3
Collapse in Diversity

4
FUSS

5
Selection Schemes

6
FUSS Selection

7
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

8
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

9
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

11
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

13
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 1001 1111 0011 4238 = 7 total cost

15
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

17
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?

18
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

20
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 www.idsia.ch for a technical report on FUDSwww.idsia.ch Maybe other variants on these ideas will work also?

Similar presentations

OK

Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.

Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google