kgal-core/kgal.operators.selection

Package-level declarations

Functions

fun <V, F> Array<Chromosome<V, F>>.selectionBest(count: Int, from: Int, to: Int): Array<Chromosome<V, F>>

Find and moves the best chromosomes to the beginning of source. (Not sort source)

selectionRandom

fun <V, F> selectionRandom(source: Array<Chromosome<V, F>>, random: Random): Chromosome<V, F>

Select randomly chromosome from source

selectionRoulette

@JvmName(name = "selectionRouletteFitByte")

fun <V> selectionRoulette(source: Array<Chromosome<V, Byte>>, totalFitness: Long, random: Random): Chromosome<V, Byte>

@JvmName(name = "selectionRouletteFitDouble")

fun <V> selectionRoulette(source: Array<Chromosome<V, Double>>, totalFitness: Double, random: Random): Chromosome<V, Double>

@JvmName(name = "selectionRouletteFitFloat")

fun <V> selectionRoulette(source: Array<Chromosome<V, Float>>, totalFitness: Float, random: Random): Chromosome<V, Float>

@JvmName(name = "selectionRouletteFitInt")

fun <V> selectionRoulette(source: Array<Chromosome<V, Int>>, totalFitness: Long, random: Random): Chromosome<V, Int>

@JvmName(name = "selectionRouletteFitLong")

fun <V> selectionRoulette(source: Array<Chromosome<V, Long>>, totalFitness: Long, random: Random): Chromosome<V, Long>

@JvmName(name = "selectionRouletteFitShort")

fun <V> selectionRoulette(source: Array<Chromosome<V, Short>>, totalFitness: Long, random: Random): Chromosome<V, Short>

Executes roulette selection. It is assumed that all individuals are "placed" on the roulette wheel.

selectionTournament

fun <V, F> selectionTournament(source: Array<Chromosome<V, F>>, tournamentSize: Int, random: Random): Chromosome<V, F>

Executes tournament selection:

fun <V, F> Array<Chromosome<V, F>>.selectionWorst(count: Int, from: Int, to: Int): Array<Chromosome<V, F>>

Find and moves the worst chromosomes to the beginning of source. (Not sort source)