roma_lib 0.1.0

A Rust metaheuristics framework inspired by jMetal for optimization and experimentation.
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

use crate::operator::traits::{MutationOperator, Operator};
use crate::solution::Solution;
use crate::utils::random::Random;

/// Swap mutation for permutation solutions.
///
/// Preserves permutation validity by swapping indexes.
#[derive(Clone)]
pub struct SwapMutation {
    name: String,
}

impl SwapMutation {
    pub fn new() -> Self {
        Self {
            name: "SwapMutation".to_string(),
        }
    }
}

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

impl Operator for SwapMutation {
    fn name(&self) -> &str {
        &self.name
    }
}

impl MutationOperator<usize> for SwapMutation {
    fn execute(&self, solution: &mut Solution<usize>, probability: f64, rng: &mut Random) {
        let n = solution.num_variables();
        if n < 2 {
            return;
        }

        let p = probability.clamp(0.0, 1.0);
        for i in 0..n {
            if rng.next_f64() < p {
                let mut j = rng.range(n as u64) as usize;
                if j == i {
                    j = (j + 1) % n;
                }
                let _ = solution.swap_variables(i, j);
            }
        }
    }
}

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

    #[test]
    fn name_is_exposed() {
        let mutation = SwapMutation::new();
        assert_eq!(mutation.name(), "SwapMutation");
    }

    #[test]
    fn keeps_same_length() {
        let mutation = SwapMutation::new();
        let mut solution = Solution::new(vec![0, 1, 2, 3, 4]);
        let mut rng = Random::new(42);

        mutation.execute(&mut solution, 1.0, &mut rng);
        assert_eq!(solution.num_variables(), 5);
    }
}