Scribd
Upload
60 views17 pages

Genetic Algorithms: by Fatih BAYIR

This document provides an overview of genetic algorithms, including: - A definition stating that genetic algorithms are optimization techniques inspired by natural selection and genetics that aim to find good enough solutions efficiently. - A brief history noting that John Holland and his students developed genetic algorithms in the 1960s and published an influential book on the topic in 1975. - Discussions of pros like not requiring derivatives and handling both continuous and discrete problems, and cons like potential computational expense and lack of guarantees. - Explanations of basic terminology like populations, chromosomes, genes, alleles, fitness functions, and genetic operators like selection, crossover, and mutation. - An outline of the genetic algorithm process involving initializing a population, evaluating fitness, selecting

Uploaded by

Fatih
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
60 views17 pages

Genetic Algorithms: by Fatih BAYIR

This document provides an overview of genetic algorithms, including: - A definition stating that genetic algorithms are optimization techniques inspired by natural selection and genetics that aim to find good enough solutions efficiently. - A brief history noting that John Holland and his students developed genetic algorithms in the 1960s and published an influential book on the topic in 1975. - Discussions of pros like not requiring derivatives and handling both continuous and discrete problems, and cons like potential computational expense and lack of guarantees. - Explanations of basic terminology like populations, chromosomes, genes, alleles, fitness functions, and genetic operators like selection, crossover, and mutation. - An outline of the genetic algorithm process involving initializing a population, evaluating fitness, selecting

Uploaded by

Fatih
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/ 17

Genetic

Algorithms
by
Fatih BAYIR
1
Outline
Definition
History
Pros and Cons
Basic Terminology
Operators
Structure

2
Definition

It is an optimization technique

A search based algorithm

Works by the concepts of natural


selection and genetics.

3
Definition
Genetic Algorithms aim to:

Not getting the best solution

Better solutions at shorter time

Good enough solution fast


enough
4
History
John Holland and his post graduate
students from Michigan University
studied evolutional computing along
1960s

John Holland puplished a book to


explain their studies about GAs in 1975.

BOOK: Adaptation in Natural and


Artificial Systems

5
Advantages
Does not require any derivative information.

Faster and more efficient as compared to the


traditional methods.

Optimizes both continuous and discrete


functions and also multi-objective problems

Provides a list of good solutions and not


just a single solution

6
Disadvantages /
Limitations
Not suited for all problems, especially problems
which are simple and for which derivative
information is available.

Fitness value is calculated repeatedly which might


be computationally expensive for some problems

Being stochastic, there are no guarantees on the


optimality or the quality of the solution.

If not implemented properly, the GA may not


converge to the optimal solution.

7
Basic Terminology
Population It is a subset of all the possible
(encoded) solutions to the given problem. The
population for a GA is analogous to the population
for human beings except that instead of human
beings, we have Candidate Solutions representing
human beings.
Chromosomes A chromosome is one such
solution to the given problem.
Gene A gene is one element position of a
chromosome.
Allele It is the value a gene takes for a particular
chromosome.

8
Basic Terminology

9
Basic Terminology
Fitness Function A fitness function
simply defined is a function which takes the
solution as input and produces the suitability
of the solution as the output. In some cases,
the fitness function and the objective
function may be the same, while in others it
might be different based on the problem.
Genetic Operators Operations applied to
the population during the algorithms work.

10
Genetic Operators
1. Selection (Reproduction): Selection is the
process of selecting parents which mate and
recombine to create off-springs for the next
generation.
Parent selection is taking good members to
produce new members, according to results of
fitness functions.

There are some types for selection process. e.g.


roulette wheel, tournament, steady state etc...

11
Genetic Operators
2. Cross-Over: Crossover is the
process of taking more than one
parent solutions (chromosomes) and
producing a child solution from them.
By recombining portions of good
solutions, the genetic algorithm is
more likely to create a better solution.

12
Genetic Operators
3. Mutation: Itis agenetic operatorused
to maintaingenetic diversityfrom one
generation of a population ofgenetic
algorithmchromosomesto the next.

Mutation alters one or more gene values


in a chromosome from its initial state. In
mutation, the solution may change
entirely from the previous solution.

13
How mutation works
A common method of implementing the
mutation operator involves generating
arandom variablefor each bit in a
sequence. This random variable tells
whether or not a particular bit will be
modified.
This mutation procedure, based on the
biologicalpoint mutation, is called single
point mutation. Other types are inversion
and floating point mutation.
14
Structure of Algorithm
1. We start with an initial population which may be
generated randomly.

2. Calculate the fitness functions for each individuals


(chromosomes) in the population.

3. Select parents from this population for mating by the


results of fitness values.

4. Apply crossover and mutation operators on the


parents to generate new off-springs.

5. And finally these off-springs replace the existing


individuals in the population and the process repeats. In
this way genetic algorithms actually try to mimic the
human evolution to some extent.
15
Flowchart

16
Thank you
For listening with interest

Any question?

17

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