Struct BrkgaNestingProblem 

pub struct BrkgaNestingProblem { /* private fields */ }

BRKGA problem definition for 2D nesting.

Implementations

impl BrkgaNestingProblem

pub fn new( geometries: Vec<Geometry2D>, boundary: Boundary2D, config: Config, cancelled: Arc<AtomicBool>, ) -> Self

Creates a new BRKGA nesting problem.

pub fn num_instances(&self) -> usize

Returns the total number of instances.

pub fn decode( &self, chromosome: &RandomKeyChromosome, ) -> (Vec<Placement<f64>>, f64, usize)

Decodes a chromosome into placements using NFP-guided placement.

The chromosome keys are interpreted as:

• Keys [0..N): placement order (sorted indices)
• Keys [N..2N): rotation indices (discretized)
• Keys [2N..3N), only when any_allow_flip: mirror flags (allow_flip support, discretized to 2 options) — a third block, same encoding style as rotation, only present when at least one geometry can use it (keeps the chromosome at its original 2N length for problems that never need mirroring).

Trait Implementations

impl BrkgaProblem for BrkgaNestingProblem

fn num_keys(&self) -> usize

Returns the number of random keys needed for one solution.

fn evaluate(&self, chromosome: &mut RandomKeyChromosome)

Evaluates the fitness of a chromosome and updates its fitness value.

fn on_generation( &self, generation: u32, best: &RandomKeyChromosome, _population: &[RandomKeyChromosome], )

Called after each generation (for progress reporting).

fn evaluate_parallel(&self, chromosomes: &mut [RandomKeyChromosome])

Evaluates multiple chromosomes in parallel. Default implementation uses rayon when the parallel feature is enabled.