Genetic Algorithms:
Genetic Algorithm (GA) is a search-based optimization technique based on the principles of Genetics and
Natural Selection.
Genetic algorithms (GAs) are a type of computational optimization technique inspired by the principles of
natural selection and genetics. They are used to solve complex problems by mimicking the process of
evolution to improve a population of potential solutions iteratively.
These algorithms operate on a set of candidate solutions encoded as strings of binary digits or other data
structures.
Each individual within the population corresponds to a particular solution, and a set of parameters called
genes defines its characteristics.
These genes encode the properties or features of the solution, and they can be represented as binary strings,
real-valued numbers, or other data types.
The genetic algorithm begins with an initial population of individuals, typically generated randomly. It
then goes through a series of iterations, known as generations or epochs, in which the individuals undergo
operations such as selection, crossover, and mutation.
These operations mimic the processes of natural selection, reproduction, and genetic variation observed in
biological evolution.
02/11/2025 1
Genetic Algorithms(contd.,):
02/11/2025 2
Genetic Algorithms(contd.,):
Optimization is the process of making something better. In any process, we have a set of inputs and a set
of outputs as shown in the following figure.
Optimization refers to finding the values of inputs in such a way that we get the “best” output values. The
definition of “best” varies from problem to problem, but in mathematical terms, it refers to maximizing or
minimizing one or more objective functions, by varying the input parameters.
The set of all possible solutions or values which the inputs can take make up the search space. In this
search space, lies a point or a set of points which gives the optimal solution. The aim of optimization is to
find that point or set of points in the search space.
02/11/2025 3
How the Genetic Algorithm works:
02/11/2025 4
How the Genetic Algorithm works(contd.,):
02/11/2025 5
Key Terminologies in Genetic Algorithms:
02/11/2025 6
Benefits and Uses of Genetic Algorithms:
The solutions created through genetic algorithms are strong & reliable as compared to other solutions.
They increase the size of solutions as solutions can be optimized over a large search scale. This algorithm
also can manage a large population.
The solutions produced by genetic algorithms do not deviate much on slightly changing the input. They
can handle a little bit of noise.
Genetic algorithms have a stochastic distribution that follows probabilistic transition rules, making them
hard to predict but easy to analyze.
Genetic algorithms can also perform in noisy environments. It can also work in case of complex & discrete
problems.
Due to their effectiveness, genetic algorithms have many applications like neural networks, fuzzy logic,
code-breaking, filtering & signal processing.
02/11/2025 7
Limitations of Genetic Algorithms:
Computational Intensity: Genetic algorithm in artificial intelligence can be computationally demanding,
especially for complex problems and large solution spaces, leading to longer processing times.
Solution Quality: There’s no guarantee of finding the optimal solution. GAs may converge to local
optimal or suboptimal solutions, especially if the search space is not well-explored.
Parameter Sensitivity: Performance is sensitive to the choice of parameters like crossover and mutation
rates. Suboptimal parameter settings can hinder convergence.
Difficulty in Representation: Choosing an appropriate representation for problem solutions can be
challenging, and a poorly chosen representation may impede the algorithm’s effectiveness.
Not Always Suitable for Continuous Spaces: Genetic algorithms in AI are more natural for discrete
search spaces. Adapting them for continuous optimization problems requires additional techniques like
encoding and decoding.
Limited Handling of Constraints: Managing constraints in optimization problems can be tricky. Ensuring
solutions meet all constraints might require additional mechanisms.
02/11/2025 8
02/11/2025 9
