EXPLORAT 1

ION OF
GENETIC
ALGORITH
M (GA)

BY
BABALOLA A.E.
 2

CONTENTS

Problem
Introduction Optimization
Solving

Applications
Metaheuristc Genetic
of Genetic
s Algorithms
Algorithm
 3

INTRODUCTION

Computers play a pivotal

role in problem-solving
across various domains due Problem-solving is crucial in
to their capability to process various domains because it
vast amounts of data, serves as the cornerstone
execute complex for progress, innovation,
algorithms, and perform and advancement.
calculations at incredible
speeds.
 4

INTRODUCTION

Problem-solving and algorithms are

deeply intertwined, as algorithms provide
systematic methods for solving problems
across various domains.
 5

 An algorithm is a step-by-step procedure of

solving a problem. It is a series of activities
to be processed for getting desired output
INTRODUCTI from a given input.

ON  An algorithm has input data, and is

expected to produce output after carrying
out a process which is the actions taken to
achieve the required outcome.
 6

 GA is often linked with a class of problem that

require the search for optimal solution from a
range of alternatives called optimization problems.
INTRODUCTI  Optimization is the process of finding the best
ON solution or achieving the optimal outcome from a
set of feasible alternatives, given specific
constraints, objectives, and criteria
 7

Types of
Optimization
Algorithms

Deterministic Stochastic

Metaheuristic
TYPES OF
Heuristics
s

Trajectory
Population-
OPTIMIZATION
based
ALGORITHMS
Evolutionary
Algorithms

Swarm
Intelligence
 8

 Deterministic algorithms are computational

procedures or methods that, given the same input
and conditions, always produce the same output.

Deterministi  These algorithms follow a predefined set of rules

or steps, leading to predictable outcomes without
c Algorithms any randomness.
 Examples are the Newton-Raphson approach,
Nelder-Mead, Linear programming, etc.
 9

 Stochastic algorithms are computational methods

that incorporate randomness or probability in their
operation.

Stochastic  Unlike deterministic algorithms, which produce the

Algorithms same output for a given input, stochastic

algorithms exhibit non-deterministic behavior,
meaning their output may vary even when given
the same input.
 10

 Heuristics are problem-dependent techniques that

use practical rules or guidelines to find approximate
solutions to complex problems, especially in
Heuristics situations where an optimal solution is difficult or
impossible to obtain in a reasonable amount of time.
 Examples are Rule of thumb, trial and error, etc.
 11

Metaheuristics

Unlike specific algorithms that

Metaheuristics are higher-level
are tailored to particular
problem-solving strategies that
problem instances,
provide a framework for
metaheuristics are general-
efficiently exploring large
purpose techniques that can
solution spaces and finding
be applied to a wide range of
high-quality solutions to
optimization problems without
complex optimization
requiring detailed problem-
problems.
specific knowledge.
 12

Metaheuristics
 Metaheuristics operate within a
search space, representing all
possible solutions to the
optimization problem.
 13

Firefly Genetic Particle

Examples of Algorithm Algorithm Swarm
Optimization
Metaheuristi
cs
African Ant Colony
Buffalo Algorithm
Optimization
Examples of Metaheuristics
14

Bat Algorithm

Particle Swarm
Optimization

Firefly Algorithm
 15

Genetic Algorithm is a
biologically-inspired
algorithm developed by John
Genetic Holland.

Algorithm
(GA) It is based on Darwin’s
principle of Survival of the
fittest.
 16

Terms Meaning in Genetic Algorithm

Population Population of candidate solutions (individuals)
Individual Candidate solution represented as a chromosome
A gene is the GA’s representation of a single
Genes
factor for a control factor.
Fitness function evaluates the quality of each
Fitness
individual solution
Selection mechanism determines which
Genetic Selection individuals are chosen for reproduction based on
their fitness

Algorithm Genetic operators (crossover and mutation)

Reproduction create offspring by combining genetic material

(GA)
from selected individuals
Offspring New solutions generated through reproduction
Environment represents the problem landscape,
Environment
where solutions compete for survival
Survival of the Individuals with higher fitness are more likely to
Fittest be selected for reproduction
Iterative process where populations evolve over
Evolution
generations, improving solutions over time
Termination criteria determine when the
Termination
algorithm stops (e.g., reaching a maximum
 17

Genetic
Algorithm
(GA)
 18

Application of Genetic Algorithm (GA)

 Scheduling and Planning

 Control system design and optimization
 Structural design optimization
 Feature selection and extraction
 Network routing and optimization
 19

 Food items are represented as genes, while the

collection of genes makes up several meals
denoted as chromosomes. A chromosome will be
Diet represented as a combination of genes that make

Problem up a meal.
 20

Food Servin Calori cos Food Servin Calori cos Food Servi Calori cos
item g size e t item g size e t item ng e t
size
Bread 20g 50 50 Tea 50g 30 100 Fried 60g 120 150
egg

Sample food Amala

Jollof rice
70g
100g
90
70
100
200
Veg
Plantai
100g
40g
20
110
100
150
Fish
Chick
30g
50g
80
150
100
300

dataset
n en
 21

METHODOLOGY
 Crossover: The selection process is
followed by crossover which helps to
combine the traits of parents to create
offspring.
Parent 2 Amala Ewedu Beef

Genetic
Operations

 Mutation: This is used to create new

individuals byAmala
alteringPounded
one oryam
more genes
present in a chromosome thereby
increasing diversity in the population.
 22

Conclusion
 Genetic Algorithm stands out as a versatile
problem-solving technique.
 It finds application in diverse fields such as
engineering, finance, logistics, healthcare,
etc., because of its ability to handle complex,
multi-dimensional optimization problems.
 23

Thank
you
 24

 Sivanandam, S. N., Deepa, S. N., Sivanandam, S.

N., & Deepa, S. N. (2008). Genetic algorithms (pp.
15-37). Springer Berlin Heidelberg.
 Burke, E. K., Burke, E. K., Kendall, G., & Kendall, G.

References (2014). Search methodologies: introductory

tutorials in optimization and decision support
techniques. Springer.
 Vasuki, A. (2020). Nature-inspired optimization
algorithms. CRC Press.