Struct TournamentSelection 

pub struct TournamentSelection { /* private fields */ }

Represents the tournament selection algorithm.

Note

The tournament selection method involves selecting a fixed number of random candidates from the population (determined by tournament’s size) and choosing the candidate with the highest fitness.

Implementations

impl TournamentSelection

pub fn new(size: usize) -> Self

Creates a new instance.

Panics

The method will panic if size is zero.

pub fn size(&self) -> usize

Gets the tournament size.

pub fn set_size(&mut self, size: usize)

Sets the tournament size.

Panics

The method will panic if size is zero.

Trait Implementations

impl Clone for TournamentSelection

fn clone(&self) -> TournamentSelection

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl PartialEq for TournamentSelection

fn eq(&self, other: &TournamentSelection) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I, R> SelectionMechanism<I, R> for TournamentSelection

where I: Individual, R: Rng,

fn prepare(&mut self, _population: &Population<I>)

Prepares the mechanism for a new population.

fn select<'a>( &self, population: &'a Population<I>, rng: &mut R, ) -> (usize, &'a I)

Selects an individual from the population.

fn select_distinct<'a>( &self, population: &'a Population<I>, rng: &mut R, max_tries: usize, excluded: &I, ) -> Option<(usize, &'a I)>

where I: Individual, R: Rng,

Selects an individual from the population, excluding a specific individual. The selection attempt will be repeated for a specified number of tries (max_tries), or until a different individual is found.

impl Copy for TournamentSelection

impl Eq for TournamentSelection

impl StructuralPartialEq for TournamentSelection