pub struct Nsga2<G, F, C, M> {
pub population_size: usize,
pub crossover_probability: f64,
pub mutation_probability: f64,
pub bounds: Option<MultiBounds>,
/* private fields */
}Expand description
NSGA-II algorithm
Fields§
§population_size: usizePopulation size
crossover_probability: f64Crossover probability
mutation_probability: f64Mutation probability
bounds: Option<MultiBounds>Problem bounds
Implementations§
Source§impl<G, F, C, M> Nsga2<G, F, C, M>where
G: EvolutionaryGenome,
F: MultiObjectiveFitness<G>,
C: CrossoverOperator<G>,
M: MutationOperator<G>,
impl<G, F, C, M> Nsga2<G, F, C, M>where
G: EvolutionaryGenome,
F: MultiObjectiveFitness<G>,
C: CrossoverOperator<G>,
M: MutationOperator<G>,
Sourcepub fn with_crossover_probability(self, prob: f64) -> Self
pub fn with_crossover_probability(self, prob: f64) -> Self
Set crossover probability
Sourcepub fn with_mutation_probability(self, prob: f64) -> Self
pub fn with_mutation_probability(self, prob: f64) -> Self
Set mutation probability
Sourcepub fn with_bounds(self, bounds: MultiBounds) -> Self
pub fn with_bounds(self, bounds: MultiBounds) -> Self
Set bounds
Sourcepub fn initialize_population<R: Rng>(
&self,
fitness: &F,
bounds: &MultiBounds,
rng: &mut R,
) -> Vec<Nsga2Individual<G>>
pub fn initialize_population<R: Rng>( &self, fitness: &F, bounds: &MultiBounds, rng: &mut R, ) -> Vec<Nsga2Individual<G>>
Initialize random population
Sourcepub fn tournament_select<'a, R: Rng>(
&self,
population: &'a [Nsga2Individual<G>],
rng: &mut R,
) -> &'a Nsga2Individual<G>
pub fn tournament_select<'a, R: Rng>( &self, population: &'a [Nsga2Individual<G>], rng: &mut R, ) -> &'a Nsga2Individual<G>
Binary tournament selection with crowded comparison
Sourcepub fn create_offspring<R: Rng>(
&self,
population: &[Nsga2Individual<G>],
fitness: &F,
crossover: &C,
mutation: &M,
rng: &mut R,
) -> Vec<Nsga2Individual<G>>
pub fn create_offspring<R: Rng>( &self, population: &[Nsga2Individual<G>], fitness: &F, crossover: &C, mutation: &M, rng: &mut R, ) -> Vec<Nsga2Individual<G>>
Create offspring population
Sourcepub fn step<R: Rng>(
&self,
population: &mut Vec<Nsga2Individual<G>>,
fitness: &F,
crossover: &C,
mutation: &M,
rng: &mut R,
)
pub fn step<R: Rng>( &self, population: &mut Vec<Nsga2Individual<G>>, fitness: &F, crossover: &C, mutation: &M, rng: &mut R, )
Run one generation of NSGA-II
Sourcepub fn run<R: Rng>(
&self,
fitness: &F,
crossover: &C,
mutation: &M,
bounds: &MultiBounds,
max_generations: usize,
rng: &mut R,
) -> EvoResult<Vec<Nsga2Individual<G>>>
pub fn run<R: Rng>( &self, fitness: &F, crossover: &C, mutation: &M, bounds: &MultiBounds, max_generations: usize, rng: &mut R, ) -> EvoResult<Vec<Nsga2Individual<G>>>
Run NSGA-II for a fixed number of generations
Sourcepub fn get_pareto_front(
population: &[Nsga2Individual<G>],
) -> Vec<&Nsga2Individual<G>>
pub fn get_pareto_front( population: &[Nsga2Individual<G>], ) -> Vec<&Nsga2Individual<G>>
Get the Pareto front (rank 0 individuals)
Source§impl<G, F, C, M> Nsga2<G, F, C, M>where
G: EvolutionaryGenome,
F: MultiObjectiveFitness<G>,
C: BoundedCrossoverOperator<G>,
M: BoundedMutationOperator<G>,
Version with bounded operators
impl<G, F, C, M> Nsga2<G, F, C, M>where
G: EvolutionaryGenome,
F: MultiObjectiveFitness<G>,
C: BoundedCrossoverOperator<G>,
M: BoundedMutationOperator<G>,
Version with bounded operators
Sourcepub fn create_offspring_bounded<R: Rng>(
&self,
population: &[Nsga2Individual<G>],
fitness: &F,
crossover: &C,
mutation: &M,
bounds: &MultiBounds,
rng: &mut R,
) -> Vec<Nsga2Individual<G>>
pub fn create_offspring_bounded<R: Rng>( &self, population: &[Nsga2Individual<G>], fitness: &F, crossover: &C, mutation: &M, bounds: &MultiBounds, rng: &mut R, ) -> Vec<Nsga2Individual<G>>
Create offspring population with bounded operators
Sourcepub fn step_bounded<R: Rng>(
&self,
population: &mut Vec<Nsga2Individual<G>>,
fitness: &F,
crossover: &C,
mutation: &M,
bounds: &MultiBounds,
rng: &mut R,
)
pub fn step_bounded<R: Rng>( &self, population: &mut Vec<Nsga2Individual<G>>, fitness: &F, crossover: &C, mutation: &M, bounds: &MultiBounds, rng: &mut R, )
Run one generation with bounded operators
Sourcepub fn run_bounded<R: Rng>(
&self,
fitness: &F,
crossover: &C,
mutation: &M,
bounds: &MultiBounds,
max_generations: usize,
rng: &mut R,
) -> EvoResult<Vec<Nsga2Individual<G>>>
pub fn run_bounded<R: Rng>( &self, fitness: &F, crossover: &C, mutation: &M, bounds: &MultiBounds, max_generations: usize, rng: &mut R, ) -> EvoResult<Vec<Nsga2Individual<G>>>
Run NSGA-II with bounded operators
Auto Trait Implementations§
impl<G, F, C, M> Freeze for Nsga2<G, F, C, M>
impl<G, F, C, M> RefUnwindSafe for Nsga2<G, F, C, M>
impl<G, F, C, M> Send for Nsga2<G, F, C, M>
impl<G, F, C, M> Sync for Nsga2<G, F, C, M>
impl<G, F, C, M> Unpin for Nsga2<G, F, C, M>
impl<G, F, C, M> UnsafeUnpin for Nsga2<G, F, C, M>
impl<G, F, C, M> UnwindSafe for Nsga2<G, F, C, M>
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§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.