pub struct NSGAIII { /* private fields */ }Expand description
NSGA-III (Non-dominated Sorting Genetic Algorithm III) implementation Designed for many-objective optimization (4+ objectives)
Implementations§
Source§impl NSGAIII
impl NSGAIII
Sourcepub fn new(
n_variables: usize,
n_objectives: usize,
config: Option<MultiObjectiveConfig>,
) -> Self
pub fn new( n_variables: usize, n_objectives: usize, config: Option<MultiObjectiveConfig>, ) -> Self
Create new NSGA-III optimizer
Sourcepub fn with_reference_points(
n_variables: usize,
n_objectives: usize,
reference_points: Array2<f64>,
config: Option<MultiObjectiveConfig>,
) -> Result<Self, OptimizeError>
pub fn with_reference_points( n_variables: usize, n_objectives: usize, reference_points: Array2<f64>, config: Option<MultiObjectiveConfig>, ) -> Result<Self, OptimizeError>
Create NSGA-III with custom reference points
Sourcepub fn with_bounds(
self,
lower: Array1<f64>,
upper: Array1<f64>,
) -> Result<Self, OptimizeError>
pub fn with_bounds( self, lower: Array1<f64>, upper: Array1<f64>, ) -> Result<Self, OptimizeError>
Set variable bounds
Sourcepub fn generate_reference_points(
n_objectives: usize,
n_divisions: usize,
) -> Array2<f64>
pub fn generate_reference_points( n_objectives: usize, n_divisions: usize, ) -> Array2<f64>
Generate structured reference points using Das and Dennis method
Sourcepub fn optimize<F, C>(
&mut self,
objective_fn: F,
constraint_fn: Option<C>,
) -> Result<MultiObjectiveResult, OptimizeError>
pub fn optimize<F, C>( &mut self, objective_fn: F, constraint_fn: Option<C>, ) -> Result<MultiObjectiveResult, OptimizeError>
Optimize multiple objectives using NSGA-III
Auto Trait Implementations§
impl Freeze for NSGAIII
impl RefUnwindSafe for NSGAIII
impl Send for NSGAIII
impl Sync for NSGAIII
impl Unpin for NSGAIII
impl UnwindSafe for NSGAIII
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.