pub struct Zdt1 { /* private fields */ }Expand description
ZDT1 (Zitzler, Deb & Thiele 2000): a two-objective benchmark with a known,
convex Pareto front. On [0, 1]^n,
f1 = x1
g = 1 + 9 · (Σ_{i≥2} xi) / (n − 1)
f2 = g · (1 − √(f1 / g))The Pareto-optimal set has x2 … xn = 0 (so g = 1), giving the analytical
front f2 = 1 − √f1 for f1 ∈ [0, 1] — the ground truth the NSGA-II test
measures distance to.
Implementations§
Trait Implementations§
Source§impl MultiProblem for Zdt1
impl MultiProblem for Zdt1
Source§fn n_objectives(&self) -> usize
fn n_objectives(&self) -> usize
Number of objectives (≥ 2 for a genuine multi-objective problem).
Source§fn objectives(&self, x: &[f64]) -> Vec<f64>
fn objectives(&self, x: &[f64]) -> Vec<f64>
The objective vector to minimize, length
MultiProblem::n_objectives.Auto Trait Implementations§
impl Freeze for Zdt1
impl RefUnwindSafe for Zdt1
impl Send for Zdt1
impl Sync for Zdt1
impl Unpin for Zdt1
impl UnsafeUnpin for Zdt1
impl UnwindSafe for Zdt1
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