NETAJI SUBHASH

ENGINEERING COLLEGE

GENETIC
ALGORITHM
S U B MITTED BY:

TUHIN SADHUKHAN

U N I V E R S I T Y R O L L : 1 0 9 016 210 6 0 , ( C L A S S R O L L : 4 9 )

E L E C T R I C A L E N G I N E E R I N G D E PA R T M E N T

8 TH S E M E ST E R 4 TH Y E A R
 Introduction
•Genetic algorithms are defined as 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.
•This article explains the fundamentals of genetic algorithms, their applications, and some
key examples.
 What Are Genetic Algorithms?
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.
At the core of a genetic algorithm is the concept of a population, representing a collection
of potential solutions to the problem at hand. Each individual within the population
corresponds to a particular solution, and a set of parameters called genes defines its
characteristics.
 How the genetic algorithm works
Let’s consider an example that involves optimizing a common task: finding the best route
to commute from home to work.
Imagine you want to optimize your daily commute and find the shortest route to go from
your home to your workplace. You have multiple possible routes to choose from, each
with different distances, traffic conditions, and travel times. You can use a GA to help you
find the optimal route.
 Encoding the solutions
In this case, potential solutions can be encoded as permutations of the cities or locations
along the commute route. For example, you can represent each possible route as a string
of city identifiers, such as “A-B-C-D-E-F,” where each letter represents a location (e.g., a
street, intersection, or landmark).
 Mutation
Introduce random changes in the routes through mutation. This helps explore new
possibilities and avoid getting stuck in local optima. A mutation operation could involve
randomly swapping two cities in a route, inserting a new city, or randomly changing the
order of a few cities.
 Final solution
Once the GA terminates, the best solution, typically the route with the lowest evaluation
value, represents the optimal or near-optimal route for your daily commute.
By iteratively applying selection, crossover, and mutation, GAs help explore and evolve
the population of routes, gradually converging toward the shortest and most efficient route
for your daily commute.
It’s important to note that GAs require appropriate parameter settings, such as population
size, selection strategy, crossover and mutation rates, and termination criteria, to balance
exploration and exploitation.
 Applications of Genetic Algorithms
1.Optimization problems
2.Combinatorial optimization
3.Machine learning
4.Evolutionary robotics
5.Image and signal processing
6.Design and creativity