Scribd
Upload
26 views43 pages

AI Lecture 05 (Genetic Algorithm)

The document outlines a lecture on Genetic Algorithms (GAs) as part of an Artificial Intelligence course, covering their biological background, basic concepts, encoding methods, and various operators such as selection, crossover, and mutation. It includes examples and pseudo-code to illustrate the GA process. Additionally, it lists references and books for further reading on the topic.

Uploaded by

Saif Reza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views43 pages

AI Lecture 05 (Genetic Algorithm)

The document outlines a lecture on Genetic Algorithms (GAs) as part of an Artificial Intelligence course, covering their biological background, basic concepts, encoding methods, and various operators such as selection, crossover, and mutation. It includes examples and pseudo-code to illustrate the GA process. Additionally, it lists references and books for further reading on the topic.

Uploaded by

Saif Reza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

GENETIC ALGORITHMS

Course Code: CSC4226 Course Title: Artificial Intelligence and Expert System

Dept. of Computer Science


Faculty of Science and Technology

Lecture No: Five (5) Week No: Five (5) Semester:


Lecturer: Shaikat Das Joy
Lecture Outline

1. What are GA’s ?


2. Biological Background.
3. Basic Genetic Algorithm.
4. Encoding.
5. Operators of GA.
6. Example Problem.
What are GAs?
WHY GA?
GA: BASIC CONCEPT
BIOLOGICAL BACKGROUND
BIOLOGICAL BACKGROUND
GA: FLOW-CHART
GA: PSEUDO-CODE
ENCODING
BINARY ENCODING
Example: Binary Encoding
Value Encoding
Permutation Encoding
Examples: Permutation Encoding
Operators of GA
Selection
Example of Selection
Example of Selection
Roulette Wheel Selection

Calculate fitness value

Calculate fitness value
Mutation
Roulette Wheel Selection
Crossover
One-Point Crossover
Two-Point Crossover
Uniform Crossover
Arithmetic Crossover
Heuristic Crossover
Three Parents Crossover
If there are three parent chromosome

P1 : 0 1 1 0 1 0
P2: 1 1 0 1 0 0

P3: 1 0 0 1 0 1

To generate Offspring1 or O1 from P1,P2,P3


For O2 and O3 repeat
If P1 == P2 the same with
(P1,P3,P2) and
THEN SELECT P1
(P2,P3,P1)
IF P1 != P2

THEN SELECT P3

O1 : 1 1 0 1 1 0
Mutation
Flip Bit Mutation
Demonstration
GA Approach
GA Approach
Calculating Fitness & Probability
Selection
Crossover
Mutate & Re-evaluate
Improved:
Individual & Total Fitness
References

1. “Practical Genetic Algorithms,” by Randy L. Haupt and Sue Ellen Haupt.


Books

1. “Artificial Intelligence: A Modern Approach,” by Stuart J. Russell and Peter Norvig.


2. "Artificial Intelligence: Structures and Strategies for Complex Problem Solving", by
George F. Luger, (2002)
3. "Artificial Intelligence: Theory and Practice", by Thomas Dean.
4. "AI: A New Synthesis", by Nils J. Nilsson.
5. “Programming for machine learning,” by J. Ross Quinlan,
6. “Neural Computing Theory and Practice,” by Philip D. Wasserman, .
7. “Neural Network Design,” by Martin T. Hagan, Howard B. Demuth, Mark H. Beale,
.
8. “Practical Genetic Algorithms,” by Randy L. Haupt and Sue Ellen Haupt.
9. “Genetic Algorithms in Search, optimization and Machine learning,” by David E.
Goldberg.
10."Computational Intelligence: A Logical Approach", by David Poole, Alan
Mackworth, and Randy Goebel.
11.“Introduction to Turbo Prolog”, by Carl Townsend.

You might also like