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

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

use crate::candidate::Candidate;
use crate::game::*;

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

#[derive(Debug, Clone)]
pub struct Sample<const N: usize, const NSYMS: usize> {
    pub tries_per_game: std::ops::Range<usize>,
}

/// a single game between two candidates Each game consists of a number of point
/// tries in range tries_per_game. Each try randomly selects a score position,
/// and whichever candidate has the higher score at that position wins the
/// point. Whoever has the most points wins. In the case of a tie, up to 10 tie
/// breakers are attempted. If it is still tied after 10 tie-breakers, the point
/// goes to left.
impl<const N: usize, const NSYMS: usize> Sample<N, NSYMS> {
    pub const fn new(tries_per_game: std::ops::Range<usize>) -> Self {
        Sample { tries_per_game }
    }
}

impl<const N: usize, const NSYMS: usize> Game<N, NSYMS> for Sample<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 mut rpts = 0;
        let mut lpts = 0;
        let tries = rng.gen_range(self.tries_per_game.clone());

        for i in 0..tries + 10 {
            let pos = rng.gen_range(0..left.scores.len());
            if left.scores[pos] < right.scores[pos] {
                rpts += 1;
            } else if left.scores[pos] > right.scores[pos] {
                lpts += 1;
            }
            // if either left or right is NaN we fall through with no winner, which is desired behaviour.

            if rpts != lpts && i + 1 >= tries {
                break;
            }
        }

        if lpts >= rpts {
            LeftRight::Left
        } else {
            LeftRight::Right
        }
    }
}
#[cfg(test)]
mod tests {
    use super::*;
    const TRIES_PER_GAME: std::ops::Range<usize> = 1usize..4;

    #[test]
    fn test_game() {
        let mut r = Rando::default();
        r.expect_gen_range()
            .with(predicate::eq(TRIES_PER_GAME))
            .times(1)
            .return_const(1usize);
        r.expect_gen_range()
            .with(predicate::eq(0..9))
            .times(1)
            .return_const(2usize);
        let g = Sample::<5, 3>::new(TRIES_PER_GAME);
        assert_eq!(
            LeftRight::Left,
            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: 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_violations() {
        let mut r = Rando::default();
        let g = Sample::<5, 3>::new(TRIES_PER_GAME);
        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(TRIES_PER_GAME))
            .times(1)
            .return_const(1usize);
        r.expect_gen_range()
            .with(predicate::eq(0..9))
            .times(11)
            .return_const(2usize);
        let g = Sample::<5, 3>::new(TRIES_PER_GAME);
        assert_eq!(
            LeftRight::Left,
            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],
            )
        );
    }
}