ga-scheduler 0.1.0

A Genetic Algorithm optimizer designed for scheduling and similar tasks
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165

use crate::candidate::Candidate;
use crate::game::{Game, LeftRight};

#[mockall_double::double]
use crate::rando::Rando;

#[derive(Debug, Clone, Copy)]
pub struct Full<const N: usize, const NSYMS: usize> {}

/// A game that compares every score at the same position between candidate, all
/// metrics with equal weighting. The candidate with the least violations wins.
/// If that is equal, the candidate that is superior in the most scores wins. In
/// the case of a tie, winner is random.
impl<const N: usize, const NSYMS: usize> Full<N, NSYMS> {
    pub const fn new() -> Full<N, NSYMS> {
        Full {}
    }
}

impl<const N: usize, const NSYMS: usize> Game<N, NSYMS> for Full<N, NSYMS> {
    fn run(
        &self,
        left: &Candidate<N, NSYMS>,
        right: &Candidate<N, NSYMS>,
        rng: &mut Rando,
        score_weights: &Vec<f64>,
    ) -> LeftRight {
        if left.violations < right.violations {
            return LeftRight::Left;
        } else if left.violations > right.violations {
            return LeftRight::Right;
        }

        let pts = left
            .scores
            .iter()
            .zip(right.scores.iter())
            .enumerate()
            .fold((0.0, 0.0), |pts, (i, scores)| {
                if scores.0 > scores.1 {
                    (pts.0 + score_weights[i], pts.1)
                } else if scores.1 > scores.0 {
                    (pts.0, pts.1 + score_weights[i])
                } else {
                    pts
                }
            });

        if pts.0 > pts.1 {
            LeftRight::Left
        } else if pts.1 > pts.0 {
            LeftRight::Right
        } else {
            if rng.gen_range(0..2) == 0 {
                LeftRight::Left
            } else {
                LeftRight::Right
            }
        }
    }
}

#[cfg(test)]
use mockall::*;

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_game() {
        let mut r = Rando::default();
        let g = Full::<5, 3>::new();
        assert_eq!(
            LeftRight::Left,
            g.run(
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.0, 0.1, 0.2, 0.1, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 0,
                },
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.2, 0.1, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 0,
                },
                &mut r,
                &vec![1.0; 9],
            )
        );
    }

    #[test]
    fn test_game_weights() {
        let mut r = Rando::default();
        let g = Full::<5, 3>::new();
        assert_eq!(
            LeftRight::Right,
            g.run(
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.0, 0.1, 0.2, 0.1, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 0,
                },
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.2, 0.1, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 0,
                },
                &mut r,
                &vec![1.0, 1.0, 0.1, 0.1, 0.1, 0.1, 0.1, 0.1, 0.1],
            )
        );
    }

    #[test]
    fn test_game_violations() {
        let mut r = Rando::default();
        let g = Full::<5, 3>::new();
        assert_eq!(
            LeftRight::Right,
            g.run(
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.0, 0.1, 0.2, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 2,
                },
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.2, 0.1, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 1,
                },
                &mut r,
                &vec![1.0; 9],
            )
        );
    }

    #[test]
    fn test_game_tied() {
        let mut r = Rando::default();
        r.expect_gen_range()
            .with(predicate::eq(0..2))
            .times(1)
            .return_const(1usize);
        let g = Full::<5, 3>::new();
        assert_eq!(
            LeftRight::Right,
            g.run(
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 0,
                },
                &Candidate {
                    chromosone: [0, 0, 0, 0, 0],
                    scores: vec![0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],
                    violations: 0,
                },
                &mut r,
                &vec![1.0; 9],
            )
        );
    }
}