The Genetic Algorithm's Selection Algorithm Package
This package includes the genetic selection algorithms that can be used by the genetic engines.
## Package Specification

This package includes the genetic selection algorithms that can be used by the genetic engines.
Currently, we support six selection algorithms:
- Tournament Selection
- Individuals must compete in a tournament for selection. For each offspring to be produced, a tournament of n randomly
chosen individuals will be held, allowing only the best to reproduce.
- Ranked Selection
- The probability of an individual to be selected is proportional to its rank in the popultion.
- Ordered Selection
- The probability of an individual to be selected is proportional to its rank divided by the population size and the result
raised to a specified power.
- Round Robin Selection
- This meta-selection algorithm schedules the other in a round robin-like manner and then deferes selection to them. This
way, we can easily ensure that we benefit of all the advantages of all selection algorithms.
- Round Wheel Selection
- The well known round wheel selection algorithm where the probability for an individual of beeing selected is proportional
to its fitness.
- NPGA Selection
- The nieched pareto genetic algorithm for multiobjective optimization, as introduced in
*J. Horn, N. Nfpliotis, and D.E. Goldberg: "A nieched pareto genetic
algorithm for multiobjective optimization", in Proceedings of the First
IEEE Conference on Evolutionary Compuation, IEEE World Congress on
Computational Intelligence, vol. 1, pp 82-87, Piscataway, New Jersey,
IEEE Service Centre, June 1994*.