Sub - optimization
Seminar on
“GeneticAlgorithm Optimization”
Presented by –
Akash Jadhav Ty Mech (29) Suraj Bodake Ty Mech (39)
Siddhesh Chandole Ty Mech (37)
Under the Guidance of
Dr.N.A.patil
Genetic
Algorithm
Genetic algorithm optimization is an intelligent search and
optimization algorithm. It mimics the process of natural
selection to find solutions to complex problems.
Evolution of Genetic Algorithms
Early Concepts
Foundations laid by John Holland and his colleagues in the 1960s and 1970s
Main Development
Significant advancements made in the 1980s and 1990s with wide applications in
optimization and machine learning.
Modern Applications
Continued evolution and integration in diverse fields such as robotics, finance, and
data analysis.
Introduction
One of the modern optimization technique
Based on biological molecular phenomena
Principle of Natural genetics, natural selection includes
reproduction, crossover, mutation for genetic search
It is a subtype of Evolutionary Algorithm
GA repeatedly modifies a population of individual solution. At each
step, individuals are selected as parents randomly and used to
produce next generation.
In successive generation, the population evolves towards an
optimal solution.
To Generate Global
Adpative Heuristic Search Optimum Solution \high
Evolutionary Algorithm
Quality for optimization
problem
Genetics & Natural Operator of G A Population & Individual
Selection
Encoding
Selection
Mutation
Crossover
Flow Chart
Population: - It is a subset of all possible solutions given to a problem.
Chromosome: - Chromosome is one such solution to the given problem.
Gene: - Gene is one element position in chromosome.
Fitness Function: -The fitness function simply defined is a function which
takes a candidate solution to the problem as input and produces as output how
“fit” our how “good” the solution is with respect to the problem in
consideration.
Parent Selection: - It is the process of selecting parents which mate and
recombine to create off-springs for the next generation. Parent selection is very
crucial to the convergence rate of the GA as good parents drive individuals to a
better and fitter solutions.
Crossover: - Crossover is a genetic operator used to vary the programming
of a chromosome or chromosomes from one generation to the next. Two
strings are picked from the mating pool at random to crossover in order to
produce superior offspring. The method chosen depends on the Encoding
Method.
Mutation: -In simple terms, mutation may be defined as a small random tweak
in the chromosome, to get a new solution. It is used to maintain and introduce
diversity in the genetic population and is usually applied with a low probability
Termination: -The termination condition of a Genetic Algorithm is
important in determining when a GA run will end. It has been observed
that initially, the GA progresses very fast with better solutions coming in
every few iterations, but this tends to saturate in the later stages where the
improvements are very small. We usually want a termination condition
such that our solution is close to the optimal, at the end of the run.
Benefits of Genetic Algorithms
Global Optimization
Effective in finding global optimum solutions in large search spaces
Heuristic Approach
Applicable to problems with limited information and complex constraints
Parallel Processing
Capable of running in parallel, providing scalability for large-scale problems
Advantages of the genetic algorithm
The genetic algorithms put a plethora of advantages on the table.
Get acquainted with them in the next segment.
Genetic algorithms provide solutions or answers that improve over a
period.
It optimizes several problems, such as continuous functions,
discrete functions, and multi-objective problems.
It comes as the best choice for a wide variety of optimization
problems.
It has a large and broad space for solutions search ability.
Real-world Applications
Robotics Finance
Genetic algorithms used for robot path Applied in portfolio optimization and
planning and control systems. algorithmic trading strategies.
Data Analysis
Utilized for feature selection and model
optimization in data science.
A high-tech communications antenna that holds the title of the world's first
artificially evolved hardware to fly in space, was launched on the ST5 mission on
March 22, 2006 designed by NASA engineer Jason Lohn.
Future Trends
Hybrid Approaches Explainable AI Automated Design
Integration with other optimization Emphasis on interpretability Automation of algorithm design
techniques and machine learning and transparency in genetic and parameter optimization for
algorithms. algorithm applications. diverse domains.
Real-World Examples
Driverless Cars
Medical Diagnosis
Challenges and Future Directions
Local Optima Techniques to prevent genetic algorithms from
getting stuck in local optimal solutions.
Parameter Tuning Strategies to automatically adapt parameter
settings based on the problem at hand.
Scalability Addressing the challenges of applying genetic
algorithms to large-scale, high-dimensional
problems.
Conclusion
Genetic algorithm in machine learning is a member
of the evolutionary algorithm family that is used in
the computation. They are much more intelligent
than random search algorithms since they use
historical data to provide the best possible solution.
This article has illustrated it in brief, including its
foundation, working, applications, and advantages.
THANK YOU
Any Question?
