Académique Documents
Professionnel Documents
Culture Documents
Lecture 1
January, 2007
Ivan Garibay
igaribay@cs.ucf.edu
Lecture 1
• What is Evolutionary Computation?
– Evolution, Genetics, DNA
– Historical Perspective
• Genetic Algorithm Components
– Individuals, Populations
– Fitness
– Selection
– Genetic Operators
• Example
1/15/2007 University of Central Florida, 2
School of EECS
Introduction
DNA: Information
• DNA molecule is an information
structure:
– Store information digitally
(chain of nucleotides)
– Nucleotide = deoxyribose
sugar + phosphate +
Nitrogenous base
– Nitrogenous bases: Adenine,
Thymine, Cytosine, Guanine
• DNA is an amazingly efficient,
highly specialized structure for
information storage, replication,
expression and evolution
Evolutionary Computation
gene
Population
individual
Fitness based
Selection
Crossover
Mutation
Genetic Operators
allele gene
0 1 0 0 01 1 1 0 0 1 1 0 1 0 1 1 1 1 0 0 0 1 1
Problem Representation
• Problem specific
Genotype to Phenotype • Different representations
are different problems for
Genome (DNA) Organisms a GA
Computational Instance of • Map a string (structure)
Evolutionary Problem
Structure Solution
into a instance of a
solution
Bit String Ordering of
cities for TSP • Representation is very
important
Logo instructions Antena
– Define the space to be
explored
– Define the space structure:
variations are meaningful
1/15/2007 University of Central Florida, 12
School of EECS
Binary Representation
where k is a parameter.
• Computationally efficient.
– Previous methods require 2 passes:
• Compute sum
• Calculate expected number of offspring.
– Rank selection also requires a sort.
1/15/2007 University of Central Florida, 18
School of EECS
Genetic Operators
• Crossover
– Biologically inspired
– Combine genes from two individuals to form
an off-spring (sexual reproduction)
• Mutation
– Biologically inspired
– DNA is copied with errors = mutations
– Most of the time mutation = problem
– Some times = advantage
Crossover point
20/6 = 3.33
28/6 = 4.67