Struct mop_solvers::genetic_algorithm::Spea2

pub struct Spea2<C, CO, QC, M, MS, O, OR, S, SD> { /* fields omitted */ }

Types

• C: Constraint
• CO: CrossOver
• M: Mutation
• MS: Mating Selection
• O: Objective
• OR: Objective Result
• SD: Solution Domain

Methods

impl<C, CO, QC, M, MS, O, OR, S, SD> Spea2<C, CO, QC, M, MS, O, OR, S, SD> where
    QC: for<'a> QualityComparator<[O], MphOrRef<'a, OR, S>>,
    O: Obj<OR, S>,
    OR: Copy + Div<OR, Output = OR> + Mul<OR, Output = OR> + NumCast + One + PartialOrd + Pow<OR, Output = OR> + Sub<OR, Output = OR> + Zero,
    SD: SolutionDomain<S>,
    S: Clone, 

pub fn new(
    archive_size: Pct,
    gap: GeneticAlgorithmParams<CO, M, MS>,
    problem: &Mph<C, O, OR, S, SD>,
    quality_comparator: QC
) -> Self

Trait Implementations

impl<C: Debug, CO: Debug, QC: Debug, M: Debug, MS: Debug, O: Debug, OR: Debug, S: Debug, SD: Debug> Debug for Spea2<C, CO, QC, M, MS, O, OR, S, SD>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<C, CO, QC, M, MS, O, OR, S, SD> Solver<Mph<C, O, OR, S, SD>> for Spea2<C, CO, QC, M, MS, O, OR, S, SD> where
    C: Cstr<S> + TraitCfg,
    CO: Crossover<MphOrs<OR, S>> + TraitCfg,
    QC: for<'a> QualityComparator<[O], MphOrRef<'a, OR, S>> + TraitCfg,
    M: Mutation<SD, MphOrs<OR, S>> + TraitCfg,
    MS: MatingSelection<[O], MphOrs<OR, S>> + TraitCfg,
    O: Obj<OR, S> + TraitCfg,
    OR: Copy + Debug + Div<OR, Output = OR> + Mul<OR, Output = OR> + NumCast + One + PartialOrd + Pow<OR, Output = OR> + SampleUniform + Sub<OR, Output = OR> + TraitCfg + Zero,
    S: Clone + TraitCfg,
    SD: SolutionDomain<S> + TraitCfg, 

fn after_iter<'a>(
    &'a mut self,
    p: &'a mut Mph<C, O, OR, S, SD>
) -> SolverFuture<'a>

Do solving work after stoping criteria verification.

fn before_iter<'a>(
    &'a mut self,
    p: &'a mut Mph<C, O, OR, S, SD>
) -> SolverFuture<'a>

Do solving work before stoping criteria verification.

fn finished(&mut self, &mut P)

fn init(&mut self, &mut P)