Struct genetic_algorithm::strategy::permutate::Permutate
source · pub struct Permutate<G: PermutableGenotype, F: Fitness<Genotype = G>> {
pub population_size: BigUint,
/* private fields */
}
Expand description
All possible combinations of genes are iterated over as chromosomes. The fitness is calculated for each chromosome and the best is taken. For efficiency reasons the full population is never instantiated as a whole.
The chromosome_permutations_size
is subject to combinatorial explosion, so check the genotype
for practical values before using the Permutate strategy.
See PermutateBuilder for initialization options.
Example:
use genetic_algorithm::strategy::permutate::prelude::*;
use genetic_algorithm::fitness::placeholders::CountTrue;
// the search space
let genotype = BinaryGenotype::builder() // boolean alleles
.with_genes_size(16) // 16 genes per chromosome
.build()
.unwrap();
// the search strategy
let mut rng = rand::thread_rng(); // unused randomness provider implementing Trait rand::Rng
let permutate = Permutate::builder()
.with_genotype(genotype)
.with_fitness(CountTrue) // count the number of true values in the chromosomes
.with_fitness_ordering(FitnessOrdering::Minimize) // aim for the least true values
.with_multithreading(true) // use all cores
.call(&mut rng)
.unwrap();
// it's all about the best chromosome after all
let best_chromosome = permutate.best_chromosome().unwrap();
assert_eq!(best_chromosome.genes, vec![false; 16])
Fields§
§population_size: BigUint
Implementations§
source§impl<G: PermutableGenotype, F: Fitness<Genotype = G>> Permutate<G, F>
impl<G: PermutableGenotype, F: Fitness<Genotype = G>> Permutate<G, F>
pub fn builder() -> PermutateBuilder<G, F>
Trait Implementations§
source§impl<G: PermutableGenotype, F: Fitness<Genotype = G>> Strategy<G> for Permutate<G, F>
impl<G: PermutableGenotype, F: Fitness<Genotype = G>> Strategy<G> for Permutate<G, F>
fn call<R: Rng>(&mut self, rng: &mut R)
fn best_chromosome(&self) -> Option<Chromosome<G>>
fn best_generation(&self) -> usize
fn best_fitness_score(&self) -> Option<FitnessValue>
Auto Trait Implementations§
impl<G, F> Freeze for Permutate<G, F>
impl<G, F> RefUnwindSafe for Permutate<G, F>
impl<G, F> Send for Permutate<G, F>
impl<G, F> Sync for Permutate<G, F>
impl<G, F> Unpin for Permutate<G, F>
impl<G, F> UnwindSafe for Permutate<G, F>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more