Struct vrp_core::solver::population::Greedy

pub struct Greedy { /* fields omitted */ }

A population which keeps track of the best known individuals only. If solutions are equal, prefers to keep first discovered.

Implementations

impl Greedy

pub fn new(
    problem: Arc<Problem>,
    selection_size: usize,
    best_known: Option<Individual>
) -> Self

Creates a new instance of Greedy.

Trait Implementations

impl Display for Greedy

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

Formats the value using the given formatter.

impl Population for Greedy

fn add_all(&mut self, individuals: Vec<Individual>) -> bool

Adds all individuals into the population, then sorts and shrinks population if necessary. Returns true if any of newly added individuals is considered as best known.

fn add(&mut self, individual: Individual) -> bool

Adds an individual into the population. Returns true if newly added individual is considered as best known.

fn on_generation(&mut self, _: &Statistics)

Informs population about new generation event. This is time for the population to decide whether selection phase has to be changed.

fn cmp(&self, a: &Individual, b: &Individual) -> Ordering

Compares two solutions the same way as population does.

fn select<'a>(&'a self) -> Box<dyn Iterator<Item = &Individual> + 'a>

Selects parents from the population based on current selection phase.

fn ranked<'a>(&'a self) -> Box<dyn Iterator<Item = (&Individual, usize)> + 'a>

Returns subset of individuals within their rank sorted according their quality.

fn size(&self) -> usize

Returns population size.

fn selection_phase(&self) -> SelectionPhase

Returns a current selection phase.