# EEL 4818: Lectures on Genetic Algorithms

## Fall 2010

by Ivan Garibay, University of Central Florida, October 28, 2010.### Lecture 1: Evolution, November 2, 2010

- Topics:
- Evolutionary Computation
- Historical Perspective
- Basic Evolutionary Process
- Simplest Evolutionary Algorithm: EV
- Simulation of EV

- Materials:
- Evolutionary Computation (Lecture 1 handout 1)
- GA Homework Assignment
- Basic GA Java Code to be used on the GA Homework: (tar.gz format) (zip format) . Code instructions: (1) Unzip/Untar-ungzip; (2) compile "javac Search.java"; (3) run "java Search onemax.params".

- Deadlines:
- GA Homework Assignment Due: November 18, 2010

### Lecture 2: Genetics, November 4, 2010

- Topics:
- Simulation of EV
**Genetic Algorithms (GAs): What are they?**- Darwinian Evolution, Mendelian Genetics, Turing's Genetic Search, and Holland's Genetic Algorithms.
- Stochastic Search and Evolutionary Computation
- GA components: problem representation, selection function, fitness function, and genetic operators.
- GA pseudocode
- Tournament Selection
- One-point Crossover
- Bit-flip Mutation

- Materials:
- Genetic Algorithms (Lecture 2 presentation)

### Lecture 3: Search and Optimization, November 9, 2010

- Topics:
**GAs: How do they work?**- GA Optimization: One Max Problem: our class becomes a random number generator for running a single GA loop by hand
- Analysis of One Max Problem's experimental results.
**GAs: Why do they work? (stochastic search answer)**- Universal limits of search: No Free Lunch Theorems
- Search Spaces, Fitness Landscapes
- Random, Needle-in-a-haystack, and one-max fitness landscapes
- Search Algorithms and Stochastic Search
- Why stochastic search works? Key property
- Schemas

- Materials:
- Genetic Algorithms (Lecture 3 handout 1)

### Lecture 4: Schema Theorem, November 16, 2010

- Topics:
**GAs: Why do they work? (GA schema analysis answer)**- Building Block Hypothesis
- Schema Theorem (Holland, 1975)
- How does GA process schemata?
- GA implicit parallelism
- Schema Theorem with only selection
- Destructive and Constructive Effects of Crossover and Mutation on Schemata
- Probabilities of Schema Surviving Crossover and Surviving Mutation
- Complete Schema Theorem (selection, crossover and mutation)

- Materials:
- GA Homework Assignment
- Basic GA Java Code to be used on the GA Homework: (tar.gz format) (zip format) . Code instructions: (1) Unzip/Untar-ungzip; (2) compile "javac Search.java"; (3) run "java Search onemax.params".

- Deadlines:
- GA Homework Assignment Due: November 30, 2010

### Lecture 5: Projects, November 18, 2010

- Topics:
- Class project ideas for ML II, by Dr. Georgiopoulos and Dr. Garibay