Skip to main content

Nsga2

Struct Nsga2 

Source
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: usize

Population size

§crossover_probability: f64

Crossover probability

§mutation_probability: f64

Mutation probability

§bounds: Option<MultiBounds>

Problem bounds

Implementations§

Source§

impl<G, F, C, M> Nsga2<G, F, C, M>

Source

pub fn new(population_size: usize) -> Self

Create a new NSGA-II algorithm

Source

pub fn with_crossover_probability(self, prob: f64) -> Self

Set crossover probability

Source

pub fn with_mutation_probability(self, prob: f64) -> Self

Set mutation probability

Source

pub fn with_bounds(self, bounds: MultiBounds) -> Self

Set bounds

Source

pub fn initialize_population<R: Rng>( &self, fitness: &F, bounds: &MultiBounds, rng: &mut R, ) -> Vec<Nsga2Individual<G>>

Initialize random population

Source

pub fn tournament_select<'a, R: Rng>( &self, population: &'a [Nsga2Individual<G>], rng: &mut R, ) -> &'a Nsga2Individual<G>

Binary tournament selection with crowded comparison

Source

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

Source

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

Source

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

Source

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>

Version with bounded operators

Source

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

Source

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

Source

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>
where G: Send, F: Send, C: Send, M: Send,

§

impl<G, F, C, M> Sync for Nsga2<G, F, C, M>
where G: Sync, F: Sync, C: Sync, M: Sync,

§

impl<G, F, C, M> Unpin for Nsga2<G, F, C, M>
where G: Unpin, F: Unpin, C: Unpin, M: Unpin,

§

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> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V