vrp-solver 1.0.3

An extension which provides custom metaheuristic for solving VRP
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

use std::collections::VecDeque;
use vrp_core::refinement::{Individuum, Population};

pub struct SimplePopulation {
    individuums: VecDeque<Individuum>,
    size: usize,
}

impl Population for SimplePopulation {
    fn add(&mut self, individuum: Individuum) {
        self.individuums.push_front(individuum);
        self.individuums.truncate(self.size);
    }

    fn all<'a>(&'a self) -> Box<dyn Iterator<Item = &Individuum> + 'a> {
        Box::new(self.individuums.iter())
    }

    fn best(&self) -> Option<&Individuum> {
        self.individuums.front()
    }

    fn size(&self) -> usize {
        self.individuums.len()
    }
}

impl SimplePopulation {
    pub fn new(size: usize) -> Self {
        assert!(size > 1);

        Self { individuums: VecDeque::default(), size }
    }
}