Scribd
Upload
4 views19 pages

Genetic Algorithms Presentation

The document presents an overview of Genetic Algorithms, which are inspired by natural evolution and used for optimization and search problems. It covers traditional optimization techniques, the components and workflow of Simple Genetic Algorithms, and their application in solving the Travelling Salesman Problem. The advantages and limitations of Genetic Algorithms are also discussed, highlighting their global search capabilities and sensitivity to parameter settings.

Uploaded by

prakashpacet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views19 pages

Genetic Algorithms Presentation

The document presents an overview of Genetic Algorithms, which are inspired by natural evolution and used for optimization and search problems. It covers traditional optimization techniques, the components and workflow of Simple Genetic Algorithms, and their application in solving the Travelling Salesman Problem. The advantages and limitations of Genetic Algorithms are also discussed, highlighting their global search capabilities and sensitivity to parameter settings.

Uploaded by

prakashpacet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Genetic Algorithms

• Introduction to Evolutionary Search and


Optimization
• Presented by: [Your Name]
• Date: [Presentation Date]
Agenda
• 1. Introduction to Genetic Algorithms
• 2. Traditional Search and Optimization
• 3. Genetic Algorithms and Search Space
• 4. Simple Genetic Algorithm
• 5. Operators in Genetic Algorithm
• 6. Solving the Travelling Salesman Problem
Introduction to Genetic Algorithms
• • Inspired by natural evolution
• • Population-based metaheuristic search
• • Mimics selection, crossover, mutation
• • Solves optimization and search problems
Traditional Optimization
Techniques
• • Examples:
• - Gradient Descent
• - Linear Programming
• - Newton's Method
• • Limitations:
• - Require gradient info
• - May get stuck in local optima
Search Space and Genetic
Algorithm
• • Search space: all possible solutions
• • Genetic algorithm searches this space
• • Population = set of candidate solutions
• • Iterative evolution to reach optimum
Simple Genetic Algorithm (SGA)
• • Components:
• 1. Initial Population
• 2. Fitness Function
• 3. Selection
• 4. Crossover
• 5. Mutation
• • Iteratively evolves toward better solutions
Genetic Algorithm Workflow
• 1. Initialize population
• 2. Evaluate fitness
• 3. Select parents
• 4. Apply crossover & mutation
• 5. Form new population
• 6. Repeat until stopping criterion
Selection Operator
• • Selects parents based on fitness
• • Methods:
• - Roulette Wheel Selection
• - Tournament Selection
• - Rank Selection
Crossover Operator
• • Combines parts of two parents
• • Produces offspring
• • Types:
• - Single-point crossover
• - Two-point crossover
• - Uniform crossover
Mutation Operator
• • Introduces diversity
• • Alters genes randomly
• • Prevents premature convergence
• • Examples:
• - Bit flip
• - Swap mutation
Fitness Function
• • Evaluates solution quality
• • Guides selection process
• • Problem-specific
• • Higher fitness = better solution
Application: Travelling Salesman
Problem
• • Goal: Find shortest route visiting all cities
once
• • Solution = permutation of cities
• • Genetic algorithm steps:
• - Encoding routes
• - Evaluating fitness (total distance)
• - Applying crossover/mutation
Encoding for TSP
• • Chromosome = ordered list of cities
• • Ensures valid routes
• • Crossover/mutation must preserve
permutation
• • Example: Order Crossover (OX), PMX
TSP – Crossover and Mutation
• • Crossover must preserve city order
• • PMX: preserves position and order
• • Mutation: swap two cities
• • Fitness: inverse of total tour length
Advantages of Genetic Algorithms
• • Do not require gradient info
• • Global search capabilities
• • Can handle complex and nonlinear problems
• • Flexible and robust
Limitations of Genetic Algorithms
• • May require large number of evaluations
• • Sensitive to parameter settings
• • Risk of premature convergence
Conclusion
• • Genetic algorithms are powerful
• • Useful for hard optimization problems
• • TSP is a classic benchmark
• • Continue evolving research in this field
Q&A
• Any Questions?
References
• • David E. Goldberg – Genetic Algorithms in
Search, Optimization
• • Mitchell, M. – An Introduction to Genetic
Algorithms
• • IEEE Transactions on Evolutionary
Computation

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy