Mating pool

A mating pool is a concept used in evolutionary computation. More specifically, it is one of the four steps in genetic algorithm operations that places value on the fitness of individuals in a population.[1]

Typically, the population of candidate solutions for a genetic algorithm is treated as a single entity. An alternative approach is to separate only individuals who will produce offspring from the remainder of the current population. These are placed into a mating pool.[2]

Selection operators are applied to the entire population in order to determine the fittest individuals of the current population, which are then placed into the mating pool.[3] Genetic operations, such as crossover and mutation, are then applied to the mating pool to create the next generation.[4]

There are multiple ways to create a mating pool, including selecting the best individuals based on certain criteria, known as truncation selection, and choosing individuals randomly with the probability of being chosen based on fitness level, known as fitness proportionate selection. Additionally, a random sub-group can be selected from the population and then the individuals with the highest fitness are selected for the mating pool, known as tournament selection.[5]

References

  1. ↑ Regupathi, R. “Cost Optimization Of Multistoried Rc Framed Structure Using Hybrid Genetic Algorithm.” International Research Journal of Engineering and Technology (IRJET), vol. 04, no. 07, July 2017, p. 890., www.irjet.net/archives/V4/i7/IRJET-V4I7211.pdf.
  2. ↑ B.), Langdon, W. B. (William (2002). Foundations of genetic programming. Poli, Riccardo, 1961-. Berlin: Springer. ISBN 3540424512. OCLC 47717957.
  3. ↑ "Introduction to Genetic Algorithms". www.doc.ic.ac.uk. Retrieved 2017-11-09.
  4. ↑ "Genetic Operators". kal-el.ugr.es. Retrieved 2017-11-09.
  5. ↑ Rough sets and current trends in computing : first international conference, RSCTC '98, Warsaw, Poland, June 22-26, 1998 : proceedings. Polkowski, Lech., Skowron, Andrzej. Berlin: Springer. 1998. ISBN 3540646558. OCLC 39261941.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.