localsearch 0.24.0

A Library of Local Search based Metaheuristics
Documentation 
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

use std::time::Duration;

use approx::assert_abs_diff_eq;

use super::{QuadraticModel, TransitionType};
use crate::{
    optim::{LocalSearchOptimizer, TabuList, TabuSearchOptimizer},
    utils::RingBuffer,
};

#[derive(Debug)]
struct MyTabuList {
    buff: RingBuffer<TransitionType>,
}

impl MyTabuList {
    fn new(size: usize) -> Self {
        let buff = RingBuffer::new(size);
        Self { buff }
    }
}

impl Default for MyTabuList {
    fn default() -> Self {
        Self::new(10)
    }
}

impl TabuList for MyTabuList {
    type Item = TransitionType;
    fn set_size(&mut self, n: usize) {
        self.buff = RingBuffer::new(n);
    }

    fn contains(&self, transition: &TransitionType) -> bool {
        let (k1, _, x) = *transition;
        self.buff
            .iter()
            .any(|&(k2, y, _)| (k1 == k2) && (x - y).abs() < 0.005)
    }

    fn append(&mut self, transition: TransitionType) {
        self.buff.append(transition);
    }
}

#[test]
fn test() {
    let model = QuadraticModel::new(3, vec![2.0, 0.0, -3.5], (-10.0, 10.0));
    let opt = TabuSearchOptimizer::<MyTabuList>::new(1000, 25, 5, 10);
    let (final_solution, final_score) = opt
        .run(&model, None, 10000, Duration::from_secs(10))
        .unwrap();
    assert_abs_diff_eq!(2.0, final_solution[0], epsilon = 0.1);
    assert_abs_diff_eq!(0.0, final_solution[1], epsilon = 0.1);
    assert_abs_diff_eq!(-3.5, final_solution[2], epsilon = 0.1);
    assert_abs_diff_eq!(0.0, final_score.into_inner(), epsilon = 0.05);
}