Enum Algorithm 

#[non_exhaustive]
pub enum Algorithm {
    Dds(Dds),
    Sce(Sce),
    De(De),
    LShade(LShade),
    LSrtde(LSrtde),
    Pso(Pso),
    CmaEs(CmaEs),
    RestartCmaEs(RestartCmaEs),
}

A configured algorithm, for code that selects one at runtime (mirrors the CLI / client use where the optimizer is chosen by a flag).

Marked #[non_exhaustive]: new algorithms are added over time, so matches need a wildcard arm and adding a variant is not a breaking change.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Dds(Dds)

Dynamically Dimensioned Search (Tolson & Shoemaker 2007).

Sce(Sce)

Shuffled Complex Evolution, SCE-UA (Duan et al. 1992).

De(De)

Differential Evolution rand/1/bin (Storn & Price 1997).

LShade(LShade)

Success-history adaptive DE with LPSR (Tanabe & Fukunaga 2014).

LSrtde(LSrtde)

Success-rate adaptive DE, CEC 2024 winner (Stanovov & Semenkin 2024).

Pso(Pso)

Particle Swarm Optimization (Kennedy & Eberhart 1995).

CmaEs(CmaEs)

Covariance Matrix Adaptation ES (Hansen & Ostermeier 2001).

RestartCmaEs(RestartCmaEs)

CMA-ES with IPOP/BIPOP restarts (Auger & Hansen 2005; Hansen 2009).

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Algorithm

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Optimizer for Algorithm

fn optimize(&self, problem: &dyn Problem, term: &Termination) -> Report

Runs the selected algorithm.

fn with_seed(&self, seed: u64) -> Self

Returns the same configuration with its RNG seed replaced.