Struct DixonPrice 

pub struct DixonPrice { /* private fields */ }

Dixon-Price function

Valley structure. Optimum depends on dimension.

Implementations

impl DixonPrice

pub fn new(dimension: usize) -> Self

Create a new Dixon-Price function

Trait Implementations

impl BenchmarkFunction for DixonPrice

fn name(&self) -> &'static str

Name of the benchmark function

fn dimension(&self) -> usize

Dimensionality of the problem

fn bounds(&self) -> (f64, f64)

Search space bounds (min, max)

fn optimal_fitness(&self) -> f64

Optimal (minimum) fitness value

fn optimal_solution(&self) -> Option<Vec<f64>>

Optimal solution (if known)

fn evaluate_raw(&self, x: &[f64]) -> f64

Evaluate the function (returns value to be MINIMIZED)

impl Clone for DixonPrice

fn clone(&self) -> DixonPrice

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DixonPrice

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

Formats the value using the given formatter.

impl Fitness for DixonPrice

type Genome = RealVector

The genome type being evaluated

type Value = f64

The fitness value type

fn evaluate(&self, genome: &Self::Genome) -> f64

Evaluate fitness (higher = better by convention)

fn as_log_likelihood(&self, genome: &Self::Genome, temperature: f64) -> f64

Convert fitness to log-likelihood for probabilistic selection

fn gradient(&self, _genome: &Self::Genome) -> Option<Vec<f64>>

Optional: Provide gradient for gradient-assisted mutation