Struct FeasibilityRule 

pub struct FeasibilityRule {
    pub feasibility_tol: f64,
}

Deb’s feasibility tournament rule for comparing candidate solutions.

The rule defines a total order on solutions:

1. A feasible solution always beats an infeasible one.
2. Among two feasible solutions, the one with the better objective wins.
3. Among two infeasible solutions, the one with the smaller total constraint violation wins.

References

Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186.

Fields

feasibility_tol: f64

Feasibility tolerance: violations smaller than this are treated as zero.

Implementations

impl FeasibilityRule

pub fn new(feasibility_tol: f64) -> Self

Create a new feasibility rule.

pub fn compare( &self, f_a: f64, viol_a: &ViolationSummary, f_b: f64, viol_b: &ViolationSummary, ) -> Ordering

Compare two solutions a and b according to Deb’s tournament rule.

Returns std::cmp::Ordering::Less if a is preferred, Equal if they are equivalent, and Greater if b is preferred.

Arguments

• f_a, f_b — Objective values (minimisation).
• viol_a, viol_b — Constraint violations.

pub fn sort_population( &self, population: &[(f64, ViolationSummary)], ) -> Vec<usize>

Sort a list of (objective, violation) pairs in-place using the feasibility rule (best first).

Returns the sorted indices into the original slice.

Trait Implementations

impl Clone for FeasibilityRule

fn clone(&self) -> FeasibilityRule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FeasibilityRule

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

Formats the value using the given formatter.

impl Default for FeasibilityRule

fn default() -> FeasibilityRule

Returns the “default value” for a type.

impl Copy for FeasibilityRule