samyama-optimization 0.5.8

High-performance metaheuristic optimization algorithms (Jaya, Rao, TLBO, BMR, BWR, QOJaya, ITLBO) in Rust.
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

use crate::common::{Individual, OptimizationResult, Problem, SolverConfig};
use ndarray::Array1;
use rand::prelude::*;
use rayon::prelude::*;

pub struct TLBOSolver {
    pub config: SolverConfig,
}

impl TLBOSolver {
    pub fn new(config: SolverConfig) -> Self {
        Self { config }
    }

    pub fn solve<P: Problem>(&self, problem: &P) -> OptimizationResult {
        let mut rng = thread_rng();
        let dim = problem.dim();
        let (lower, upper) = problem.bounds();

        // Initialize population
        let mut population: Vec<Individual> = (0..self.config.population_size)
            .map(|_| {
                let mut vars = Array1::zeros(dim);
                for i in 0..dim {
                    vars[i] = rng.gen_range(lower[i]..upper[i]);
                }
                let fitness = problem.fitness(&vars);
                Individual::new(vars, fitness)
            })
            .collect();

        let mut history = Vec::with_capacity(self.config.max_iterations);

        for iter in 0..self.config.max_iterations {
            if iter % 10 == 0 {
                println!("TLBO Solver: Iteration {}/{}", iter, self.config.max_iterations);
            }
            let best_idx = self.find_best(&population);
            let teacher_vars = population[best_idx].variables.clone();
            let best_fitness = population[best_idx].fitness;
            let mean_vars = self.calculate_mean(&population, dim);

            history.push(best_fitness);

            // 1. Teacher Phase
            population = population
                .into_par_iter()
                .map(|mut ind| {
                    let mut local_rng = thread_rng();
                    let tf: f64 = local_rng.gen_range(1..3) as f64; // Teaching Factor (1 or 2)
                    let mut new_vars = Array1::zeros(dim);

                    for j in 0..dim {
                        let r: f64 = local_rng.gen();
                        let delta = r * (teacher_vars[j] - tf * mean_vars[j]);
                        new_vars[j] = (ind.variables[j] + delta).clamp(lower[j], upper[j]);
                    }

                    let new_fitness = problem.fitness(&new_vars);
                    if new_fitness < ind.fitness {
                        ind.variables = new_vars;
                        ind.fitness = new_fitness;
                    }
                    ind
                })
                .collect();

            // 2. Learner Phase
            let pop_len = population.len();
            for i in 0..pop_len {
                let mut learner_j_idx;
                loop {
                    learner_j_idx = rng.gen_range(0..pop_len);
                    if learner_j_idx != i { break; }
                }

                let ind_i = &population[i];
                let ind_j = &population[learner_j_idx];
                
                let mut new_vars = Array1::zeros(dim);
                for k in 0..dim {
                    let r: f64 = rng.gen();
                    let delta = if ind_i.fitness < ind_j.fitness {
                        r * (&ind_i.variables[k] - &ind_j.variables[k])
                    } else {
                        r * (&ind_j.variables[k] - &ind_i.variables[k])
                    };
                    new_vars[k] = (ind_i.variables[k] + delta).clamp(lower[k], upper[k]);
                }

                let new_fitness = problem.fitness(&new_vars);
                if new_fitness < population[i].fitness {
                    population[i].variables = new_vars;
                    population[i].fitness = new_fitness;
                }
            }
        }

        let final_best_idx = self.find_best(&population);
        let final_best = &population[final_best_idx];

        OptimizationResult {
            best_variables: final_best.variables.clone(),
            best_fitness: final_best.fitness,
            history,
        }
    }

    fn find_best(&self, population: &[Individual]) -> usize {
        let mut best_idx = 0;
        for (i, ind) in population.iter().enumerate() {
            if ind.fitness < population[best_idx].fitness {
                best_idx = i;
            }
        }
        best_idx
    }

    fn calculate_mean(&self, population: &[Individual], dim: usize) -> Array1<f64> {
        let mut mean = Array1::zeros(dim);
        for ind in population {
            mean += &ind.variables;
        }
        mean / (population.len() as f64)
    }
}