032607 - Lecture 16: 03/26/2007 Recall: Standard (Simple)...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 16: 03/26/2007 Recall: Standard (Simple) Genetic Algorithm (SGA) Fixed-size populations (n) Individuals in population are fixed-length (L) bit strings Exogenous fitness function—each bit string x has a fitness f(x)—assume that f(x)>0, all x P(t)-->P(t+1) (populations) [that is P(t) evolves to P(t+1)] via: 1. Selection of parents for P(t+1) from P(t) 2. Generation of offspring from selected parents Talked briefly about various selection methods (fitness-prop, tournament, ranked, elitist.) Generation of offspring via crossover mutation . Crossover probability p c and mutation probability p m —p c ~.75, p m ~.01 and also different kinds of crossover (one-point, two-point, or uniform.) Do some back-of-envelope calculation regarding SGA with fitness-proportional selection with one-pt. crossover (w/ prob. P c ), bitwise mutation (p m ). What is fitness-prop. selection ? A probabilistic selection method that gives every individual a non-zero probability of being selected as a parent (ie. don’t just pick the best!) and doesn’t guarantee any individual is a parent. To get the n-parents, draw from P9t); draw an individual xєP sel (x) proportional to f(x) with replacement. Fact
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

032607 - Lecture 16: 03/26/2007 Recall: Standard (Simple)...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online