RankSelection Class |
Namespace: Accord.Genetic
The RankSelection type exposes the following members.
Name | Description | |
---|---|---|
RankSelection |
Initializes a new instance of the RankSelection class.
|
Name | Description | |
---|---|---|
ApplySelection |
Apply selection to the specified population.
| |
Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) | |
Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) | |
GetHashCode | Serves as the default hash function. (Inherited from Object.) | |
GetType | Gets the Type of the current instance. (Inherited from Object.) | |
MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |
ToString | Returns a string that represents the current object. (Inherited from Object.) |
Name | Description | |
---|---|---|
HasMethod |
Checks whether an object implements a method with the given name.
(Defined by ExtensionMethods.) | |
IsEqual |
Compares two objects for equality, performing an elementwise
comparison if the elements are vectors or matrices.
(Defined by Matrix.) | |
To(Type) | Overloaded.
Converts an object into another type, irrespective of whether
the conversion can be done at compile time or not. This can be
used to convert generic types to numeric types during runtime.
(Defined by ExtensionMethods.) | |
ToT | Overloaded.
Converts an object into another type, irrespective of whether
the conversion can be done at compile time or not. This can be
used to convert generic types to numeric types during runtime.
(Defined by ExtensionMethods.) |
The algorithm selects chromosomes to the new generation depending on their fitness values - the better fitness value chromosome has, the more chances it has to become member of the new generation. Each chromosome can be selected several times to the new generation.
This algorithm is similar to Roulette Wheel Selection algorithm, but the difference is in "wheel" and its sectors' size calculation method. The size of the wheel equals to size * ( size + 1 ) / 2, where size is the current size of population. The worst chromosome has its sector's size equal to 1, the next chromosome has its sector's size equal to 2, etc.