optimization_algorithms/artificial_bee_colony/src/food.rs

73 lines
2.1 KiB
Rust
Raw Normal View History

use core::fmt;
2024-11-20 00:20:40 +03:00
use rand::Rng;
#[derive(Debug, Clone)]
pub struct FoodSource {
pub function_calculation: f64,
pub fitness_calculation: f64,
2024-11-20 00:20:40 +03:00
pub coordinates: Vec<f64>,
pub try_counter: u128,
}
impl FoodSource {
pub fn new(coordinates: Vec<f64>) -> Self {
2024-11-20 00:20:40 +03:00
let mut food_source = FoodSource {
fitness_calculation: 0.0,
function_calculation: 1.0,
2024-11-20 00:20:40 +03:00
coordinates,
try_counter: 0,
};
if !food_source.coordinates.is_empty() {
food_source.fitness_function();
}
food_source
}
fn fitness_function(&mut self) {
let calculation = Self::calculate(self.coordinates.clone());
self.function_calculation = calculation;
2024-11-20 00:20:40 +03:00
if calculation >= 0.0 {
self.fitness_calculation = 1.0 / (1.0 + calculation);
2024-11-20 00:20:40 +03:00
} else {
self.fitness_calculation = 1.0 + calculation.abs();
2024-11-20 00:20:40 +03:00
}
}
fn calculate(decision_variables: Vec<f64>) -> f64 {
let mut result = 0.0;
for element in decision_variables {
result += element * element;
}
result
}
pub fn create_food_sources(
food_source_number: u128,
decision_variable_count: usize,
upper_bound: f64,
lower_bound: f64,
) -> Vec<FoodSource> {
let mut food_sources = vec![];
for _ in 0..food_source_number {
let mut coordinates = vec![];
for _ in 0..decision_variable_count {
let random = rand::thread_rng().gen_range(lower_bound..=upper_bound);
coordinates.push(random);
}
food_sources.push(FoodSource::new(coordinates));
2024-11-20 00:20:40 +03:00
}
food_sources
}
}
impl fmt::Display for FoodSource {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(
f,
"function_calculation = {}\nfitness_calculation = {}\ncoordinates = {:#?}\ntry_counter = {}\n",
self.function_calculation, self.fitness_calculation, self.coordinates, self.try_counter
)
}
}