Scribd Logo
Upload

Welcome to Scribd!

  • 45 views

    Genetic Algorithm: BY-Swagata Nan Be1 CMPN ROLLNO.56

    Uploaded by

    sanjay nan
    This document provides an overview of genetic algorithms. It defines genetic algorithms as adaptive heuristic search algorithms inspired by Darwinian evolution. The key terms used in genetic algorithms like genes, chromosomes, population, selection, crossover and mutation are defined. The basic steps of a genetic algorithm, which initializes a random population and then iteratively applies genetic operators like selection, crossover and mutation to produce new generations until a solution is found, are outlined. Examples are given to illustrate selection, crossover and mutation. The advantages of genetic algorithms in solving large, complex optimization problems and some limitations are also discussed.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Genetic Algorithm: BY-Swagata Nan Be1 CMPN ROLLNO.56

    Uploaded by

    sanjay nan
    45 views15 pages
    This document provides an overview of genetic algorithms. It defines genetic algorithms as adaptive heuristic search algorithms inspired by Darwinian evolution. The key terms used in genetic algorithms like genes, chromosomes, population, selection, crossover and mutation are defined. The basic steps of a genetic algorithm, which initializes a random population and then iteratively applies genetic operators like selection, crossover and mutation to produce new generations until a solution is found, are outlined. Examples are given to illustrate selection, crossover and mutation. The advantages of genetic algorithms in solving large, complex optimization problems and some limitations are also discussed.

    Original Description:

    genetic algorithm basic

    Original Title

    Genetic Algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of genetic algorithms. It defines genetic algorithms as adaptive heuristic search algorithms inspired by Darwinian evolution. The key terms used in genetic algorithms like genes, chromosomes, population, selection, crossover and mutation are defined. The basic steps of a genetic algorithm, which initializes a random population and then iteratively applies genetic operators like selection, crossover and mutation to produce new generations until a solution is found, are outlined. Examples are given to illustrate selection, crossover and mutation. The advantages of genetic algorithms in solving large, complex optimization problems and some limitations are also discussed.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    45 views15 pages

    Genetic Algorithm: BY-Swagata Nan Be1 CMPN ROLLNO.56

    Uploaded by

    sanjay nan
    This document provides an overview of genetic algorithms. It defines genetic algorithms as adaptive heuristic search algorithms inspired by Darwinian evolution. The key terms used in genetic algorithms like genes, chromosomes, population, selection, crossover and mutation are defined. The basic steps of a genetic algorithm, which initializes a random population and then iteratively applies genetic operators like selection, crossover and mutation to produce new generations until a solution is found, are outlined. Examples are given to illustrate selection, crossover and mutation. The advantages of genetic algorithms in solving large, complex optimization problems and some limitations are also discussed.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 15

    GENETIC

    ALGORITHM

    BY-
    SWAGATA NAN
    BE1 CMPN
    ROLLNO.56
    GENETIC ALGORITHM

     WHAT IS A GENETIC ALGORITHM


     TERMS AND DEFINITON
     GENETIC OPERATORS
     BASIC GENETIC ALGORITHM
     EXAMPLES
    WHAT IS A GENETIC ALGORITHM
     GA’s are adaptive heuristic search algorithms based on the evolutionary ideas of
    natural selection and genetics.
     GA’s are a part of evolutionary computing, a rapidly growing idea in artificial
    intelligence. GA’s are inspired by Charles’s idea of theory of evolution-”survival
    of the fittest”.
     GA represent an intelligent exploitation of a random search used to solve
    optimization problems.
     GAs, although randomized ,exploit the historical information to direct the search
    for better performance within the search space.
     GAs are a subset of a much larger branch of computation known as Evolutionary
    Computation.
    TERMS AND DEFINITION
     ALLELE
     GENE
     CHROMOSOME
     POPULATION
     PHENOTYPE SPACE
     GENETYPE SPACE
     ENCODING
     DECODING
     FITNESS FUNCTION
    TERMS AND DEFINITION
    GENETIC OPERATORS
    GENETIC OPERATORS
     SELECTION/REPRODUCTION
    Chromosomes are selected from the population to be the parents for the crossover.
    Selection is very crucial to the convergence rate of the GA as good parents drive individuals to a
    better and fitter solutions.
    Methods-
     Roulette wheel selection
     Boltzman selection
     Tournament selection
     Rank selection
     Steady state selection etc
    GENETIC OPERATORS
     CROSSOVER
    It involves exchange of gene information between two selected chromosomes.
    The purpose of crossover operation is to allow the genetic algorithm to create new chromosomes
    that shares positive traits while simultaneously reducing the prevalence of negative traits.
    TYPES-
     Single-point crossover
     Two-point crossover
     Uniform crossover
     Mathematical crossover
     Tree crossover
    GENETIC OPERATORS
     MUTATION
    It is another refinement step that randomly changes the value of a gene from its current settings to
    different one.
    It provides GA with the opportunity to create chromosomes and information genes that can xplore
    previously uncharted areas of the solution space, thus increasing chances for the discovery of an
    optimal solution.
    TYPES-
     Bit inversion
     Order changing
     Value encoding
    BASIC GENETIC ALGORITHM
    Initialize a random population of individuals
    Compute fitness of each individual
    WHILE NOT finished DO
    BEGIN /* produce new generation */
    FOR population_size DO
    BEGIN /* reproductive cycle */
    Select two individuals from old generation, recombine
    the two individuals to give two offspring
    Make a mutation for selected individuals by altering a
    random bit in a string
    Create a new generation (new populations)
    END
    IF population has converged
    THEN finished := TRUE
    END
    EXAMPLES
     POPULATION  SELECTION

    A1 0 0 0 0 0 0

    A2 1 1 1 1 1 1
    EXAMPLES
     CROSSOVER  MUTATION
    ADVANTAGES-

    • Provides a list of “good” solutions and not just a single solution.


    • Always gets an answer to the problem, which gets better over the time.
    • Useful when the search space is very large and there are a large number of
    parameters involved.
    • Is faster and more efficient as compared to the traditional methods.

    LIMITATIONS-

    • GAs are 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.
    Thank you!!!
    Any questions?

    You might also like