EXPLORATI 1

ON OF
GENETIC
ALGORITH
M (GA)

BY
BABALOLA A.E.
 2

CONTENTS

Introduction Problem Solving Optimization

Applications of
Genetic
Metaheuristcs Genetic
Algorithms
Algorithm
 3

INTRODUCTION

Computers play a pivotal role in

problem-solving across various
Problem-solving is crucial in
domains due to their capability to
various domains because it serves
process vast amounts of data,
as the cornerstone for progress,
execute complex algorithms, and
innovation, and advancement.
perform 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
INTRODUCTI getting desired output 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

INTRODUCTI optimization problems.

ON  Optimization is the process of finding the best 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

TYPES OF
Heuristics Metaheuristics

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.
Deterministic  These algorithms follow a predefined set of rules or steps,
Algorithms leading to predictable outcomes without 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 same

Algorithms 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 situations where an optimal solution is
Heuristics 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 are

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

Metaheuristics

 Metaheuristics operate within a search

space, representing all possible solutions to
the optimization problem.
 13

Firefly Genetic Particle Swarm

Algorithm Algorithm Optimization
Examples of
Metaheuristics

African Buffalo Ant Colony

Optimization Algorithm
 Examples of Metaheuristics
14

Bat Algorithm

Particle Swarm
Optimization

Firefly Algorithm
 15

Genetic Algorithm is a biologically-

inspired algorithm developed by
John Holland.
Genetic
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 factor for a
Genes
control factor.
Fitness function evaluates the quality of each individual
Fitness
solution
Selection mechanism determines which individuals are chosen

Genetic
Selection
for reproduction based on their fitness

Genetic operators (crossover and mutation) create offspring by

Algorithm Reproduction
combining genetic material from selected individuals

(GA)
Offspring New solutions generated through reproduction
Environment represents the problem landscape, where
Environment
solutions compete for survival
Survival of the Individuals with higher fitness are more likely to be selected
Fittest for reproduction
Iterative process where populations evolve over generations,
Evolution
improving solutions over time
Termination criteria determine when the algorithm stops (e.g.,
Termination
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 represented as a combination of genes that

Diet Problem make up a meal.

 20

Food item Serving Calorie cost Food Serving Calorie cost Food Serving Calorie cost
size item size item size
Bread 20g 50 50 Tea 50g 30 100 Fried 60g 120 150
egg

Sample food
Amala 70g 90 100 Veg 100g 20 100 Fish 30g 80 100
Jollof rice 100g 70 200 Plantain 40g 110 150 Chicke 50g 150 300
n

dataset
 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 by

altering one or more genes present in a chromosome
thereby increasingAmala
diversityPounded
in the population.
yam
 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. (2014).
References Search methodologies: introductory tutorials in optimization
and decision support techniques. Springer.
 Vasuki, A. (2020). Nature-inspired optimization algorithms.
CRC Press.