Fundamentals of Genetic Algorithms
Prof. Dr. K. Adisesha
What are Genetic Algorithms
Why Genetic Algorithms?
Genetic Algorithms Background
• Directed search algorithms based on the mechanics of biological
evolution
• Developed by John Holland, University of Michigan (1970’s)
• To understand the adaptive processes of natural systems
• To design artificial systems software that retains the robustness of natural
systems
• Provide efficient, effective techniques for optimization and machine
learning applications
• Widely-used today in business, scientific and engineering circles
Some GA Application Types
Domain Application Types
Control gas pipeline, pole balancing, missile evasion, pursuit
Design semiconductor layout, aircraft design, keyboard
configuration, communication networks
Scheduling manufacturing, facility scheduling, resource allocation
Robotics trajectory planning
Machine Learning designing neural networks, improving classification
algorithms, classifier systems
Signal Processing filter design
Game Playing poker, checkers, prisoner’s dilemma
Combinatorial set covering, travelling salesman, routing, bin packing,
graph colouring and partitioning
Optimization
Classes of Search Techniques
Search techniques
Calculus-based techniques Guided random search techniques Enumerative techniques
Direct methods Indirect methods Evolutionary algorithms Simulated annealing Dynamic programming
Finonacci Newton Evolutionary strategies Genetic algorithms
Parallel Sequential
Centralized Distributed Steady-state Generational
General idea of Genetic Algorithms
Components of a GA
A problem to solve, and ...
• Encoding technique (gene, chromosome)
• Initialization procedure (creation)
• Evaluation function (environment)
• Selection of parents (reproduction)
• Genetic operators (mutation, recombination)
• Parameter settings (practice and art)
Simple Genetic Algorithm
{
initialize population;
evaluate population;
while Termination Criteria Not Satisfied
{
select parents for reproduction;
perform recombination and mutation;
evaluate population;
}
}
The GA Cycle of Reproduction
Encoding
Exercise 2: Tournament Selection
Consider a population of chromosomes with fitness values as follows: Chromosome A: Fitness = 20
Chromosome B: Fitness = 30 Chromosome C: Fitness = 15 Chromosome D: Fitness = 25
Perform tournament selection with a tournament size of 2. Select two parents from this population.
Solution: Randomly select two chromosomes for each tournament.
Tournament 1:
• Chromosome A (Fitness = 20)
• Chromosome B (Fitness = 30)
Chromosome B wins Tournament 1.
Tournament 2:
• Chromosome C (Fitness = 15)
• Chromosome D (Fitness = 25)
Chromosome D wins Tournament 2.
So, the selected parents are Chromosome B and Chromosome D.
GA: Disadvantages
1. No guarantee for optimal solution within a finite time
2. Weak theoretical basis
3. Interdependency of genes
4. Parameter tuning is an issue
5. Often computationally expensive, i.e. slow
GA: Advantages
1. A robust search technique
2. No (little) knowledge (assumption) the problem space
3. Fairly simple to develop: low development costs
4. Easy to incorporate with other methods
5. Solutions are interpretable
6. Can be run interactively, i.e. accommodate user preference
7. Provide many alternative solutions
8. Acceptable performance at acceptable costs on a wide range of problems
9. Intrinsic parallelism (robustness, fault tolerance)
Example
Find the value of (x,y,z) in which the following function is maximum using genetic
algorithm approach (only determine G1 and G2)
F(x,y) = (x-5)2 + (y-3)2 + (z-1)2 , Assume:
• The selected population consists of the following chromosomes
P0 = {(5, 3, 1), (3, 10,1), (11,5,7), (6,3,11), (1,7,13)};
0≤x≤15 and 0≤y≤15
• The fitness ratio= |F (xi,yi)|/ ∑| F (xi,yi)|
• Two–point crossover at Bit 3 and Bit 9 is used; and mutation is happened in the Bit 6.
