Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    MCDM Lecture 8

    Uploaded by

    Prithvi Guha
    Genetic algorithms are optimization algorithms based on natural selection and survival of the fittest. They simulate evolution by generating populations of candidate solutions and applying operations like selection, crossover and mutation to produce new populations. The algorithm stops when a specified fitness threshold or other stopping criteria is reached. It has advantages like working well on complex problems and being amenable to parallel computing.

    Copyright:

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

    MCDM Lecture 8

    Uploaded by

    Prithvi Guha
    11 views9 pages
    Genetic algorithms are optimization algorithms based on natural selection and survival of the fittest. They simulate evolution by generating populations of candidate solutions and applying operations like selection, crossover and mutation to produce new populations. The algorithm stops when a specified fitness threshold or other stopping criteria is reached. It has advantages like working well on complex problems and being amenable to parallel computing.

    Original Title

    MCDM Lecture 8.pptx

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Genetic algorithms are optimization algorithms based on natural selection and survival of the fittest. They simulate evolution by generating populations of candidate solutions and applying operations like selection, crossover and mutation to produce new populations. The algorithm stops when a specified fitness threshold or other stopping criteria is reached. It has advantages like working well on complex problems and being amenable to parallel computing.

    Copyright:

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

    MCDM Lecture 8

    Uploaded by

    Prithvi Guha
    Genetic algorithms are optimization algorithms based on natural selection and survival of the fittest. They simulate evolution by generating populations of candidate solutions and applying operations like selection, crossover and mutation to produce new populations. The algorithm stops when a specified fitness threshold or other stopping criteria is reached. It has advantages like working well on complex problems and being amenable to parallel computing.

    Copyright:

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

    SESSION 8

    Genetic Algorithms
    WHAT IS GENETIC ALGORITHM
     Based on the philosophy that evolution is an optimization process
     Based on natural selection and survival of the fittest concept

     Simulates evolution

     Robustness: Balance between efficacy and efficiency needed for


    survival in different environments.
    TERMINOLOGY IN GENETIC ALGORITHMS
     Population: The subset of all possible solutions to the problem
     Chromosome: One such solution

     Gene: A bit position in the chromosome.

     Allele: Value of the gene


    TESTING PERFORMANCE
     Rastrigin function
    𝑓 𝑥 = 𝐴𝑛 + σ𝑛𝑖=1{𝑥𝑖2 −𝐴𝑐𝑜𝑠(2Π𝑥𝑖 )} where n = 2 and A =10
     Rosenbrock function

    𝑓 𝑥, 𝑦 = (𝑎 − 𝑥)2 +b(𝑦 − 𝑥 2 )2 where, a=1 and b=100


    WHAT IS GENETIC ALGORITHM
     Based on natural selection – similar to biological evolution.
     Uses 3 types of rules
     Selection
     Crossover
     Mutation
    WORKING PRINCIPLE
     Start with a random initial population.
     Create new population by combining existing solutions. To create
    new population the following steps are followed.
     Compute fitness score of each member of the current population.
     Select members based on the fitness scores.
     Produce children from parents by combining the vector entries of parents
    i.e. crossover and/or by making random changes to the member itself i.e.
    mutation.
     Replace the current population by new population.
     Stop when one of the stopping criteria is satisfied.
    CROSSOVER ISSUES
     Elitist strategy: The one with highest fitness is not touched i.e.
    Not used for crossover. This is passed directly onto the next
    generation of solutions.
    STOPPING CRITERIA
    There may be various stopping criteria for the algorithm. For
    example
     When the algorithm reaches a certain value for generations.

     When a time limit is crossed.

     When a certain fitness limit is reached i.e. the best member in the
    current population has higher fitness score than what has been
    specified.
     When there is no significant limit in the objective function over a
    time known as stall time limit.
    ADVANTAGES OF GA
     Works well on complicated problems
     Easy to do parallel computing

    You might also like