1 / 16

Modified Crossover Operator Approach for Evolutionary Optimization

Modified Crossover Operator Approach for Evolutionary Optimization. A A Madkour, M A Hossain and K P Dahal. Department of Computing, School of Informatics University of Bradford, Bradford, UK. Contents. Introduction Genetic algorithm concepts The Recessive Trait Properties

eleanorberg
Download Presentation

Modified Crossover Operator Approach for Evolutionary Optimization

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Modified Crossover Operator Approach for Evolutionary Optimization A A Madkour, M A Hossain and K P Dahal. Department of Computing, School of Informatics University of Bradford, Bradford, UK

  2. Contents • Introduction • Genetic algorithm concepts • The Recessive Trait Properties • GA as a computation work • Numerical Example • Conclusion • Questions and Discussion

  3. Introduction • Over the last decade, Genetic Algorithms (GAs) have been extensively used as search and optimization tools. • The concept of the GAs was first conceived by John Holland of the University of Michigan 1975 • This investigation provides a modified approach for population inheritance using a concept taken from the Recessive Trait idea for evolutionary optimizationto reduce the randomization "lucky" of the traditional GAs crossover operator

  4. Genetic algorithm concepts • In the nucleus of each human cell there are a total of 23 pairs of chromosomes that are made up of long chemical chains called DNA . • Genetic information is stored on those chromosomes.

  5. Genetic algorithm concepts • When a baby is conceived, it is supplied with two copies of every chromosome: one copy from the mother and the other one from the father. • The information from all of those genes takes together to makes up the plan for the human body, its functions and its properties.

  6. A A A A A A A A a A a A a a M A A A a F A A a Recessive Sex linked Dominant Genetic algorithm concepts • There are three methods of human inheritance, dominant, recessive and sex linked. • The sex linked properties: expressing depend on the person sex. • The dominant properties: only one genetic trait is needed for this property to be expressed. • The recessive properties: a person needs to inherit two copies of the gene for the trait to be expressed.

  7. The Recessive Trait Propertie 100% brown eyes 25% blue eyes 50% blue eyes 100% blue eyes

  8. GA as a computation work The method of GAs evolutionary computation works as: • Create a population of individuals, • Evaluate their fitness. • Generate a new population by applying the genetic operators • Repeat this process for a number of times.

  9. Genetic operators • The genetic operators demonstrate how to generate the new population from the old ones. The Traditional genetic algorithm The Modified genetic algorithm • Ranking the old population according to its fitness • Send the good solutions to the mating pool and eliminate the bad ones using a selection method (roulette wheel selection,…). • Do a crossover randomly between the mating pool population using one of the crossover method. • Do random mutation to the created population. • Sort the population according to its fitness. • Choose the best N population to Generate the new 2N population • Generate the new population by marring the nearest fitness parents, keeping the common genes and randomly swapping the different genes, to create a 2N population. • Do random mutation to the created population.

  10. Generating of the new population The Traditional genetic algorithm (Uniform crossover) The Modified genetic algorithm

  11. Numerical Examples • The first example: Determine the minimum value of the Matlab PEAKS function. • PEAKS is a function of two variables, obtained by translating and scaling Gaussian distributions evaluated as.

  12. The minimum value evaluation of the peaks function The minimum of the PEAKS function Numerical Example

  13. Y U Numerical Examples • The second example : Development of an active vibration control (AVC) of a flexible beam system U

  14. Beam fluctuation along its length before cancellation Performance of the MGA and TGA in auto-power spectral density Beam fluctuation at the end point after cancellation in implementing the AVC system using TGA Beam fluctuation at the end point after cancellation in implementing the AVC system using MGA 2_D Beam fluctuation at the end point Numerical Example

  15. Conclusion • This research has presented the investigation into a MGA population inheritance using a concept taken from the recessive trait idea. • The MGA offered better convergence, higher accuracy and faster solution for each problem as compared to the TGA (using same initial populations, bit representation, and mutation rate). • The MGA is very sample and easy to implement for any numerical optimization problem for any fitness function.

  16. Modified Crossover Operator Approach for Evolutionary Optimization Questions & Discussion A A Madkour, M A Hossain and K P Dahal. MOSAIC Group, Department of Computing, School of Informatics, University of Bradford, Bradford, UK

More Related