Represents the entire population (the collection of RSGeneticAlgorithm.TRSGAIndividual items) in a Genetic Algorithms problem. The population class represents the set of candidate solutions in a genetic algorithm problem. In genetic algorithms ( RSGeneticAlgorithm.TRSGeneticAlgorithm component), there is a population of individuals (TRSGAPopulation), which contain chromosomes (
Bits property). These chromosomes are used to abstractly represent the solution to the search problem. They represent through their bits the DNA of each candidate solution (or individual), represented by a TRSGAIndividual class. The chromosomes are created by taking the parameters or factors (integers, booleans, floats, and enumerations) of your search problem and concatenating them together into a sequence of bits.
Genetic Algorithms then work by evolving your population towards the solution of the problem. Parents are selected from the current generation to reproduce the children of the next generation. Evolving a new generation involves:
• | Selecting 2 parents (Individuals) to reproduce |
• | Splicing the chromosomes of the 2 parents together to make a child (the child inherits the parents chromosomes) |
• | Optionally Mutating and Inverting the chromosome of the child to provide randomness |
• | Repeating the above steps until the population of the new generation has been produced. |
Namespace: RSGeneticAlgorithm
|
Name
|
Description
|
|
Items[Integer]
|
Lists the individuals of the population object. Use the Items property to iterate through all the individuals. Index identifies the index in the range 0 to Count - 1.
|
Top
|