Tahinli/optimization_algorithms
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat: ✨ now able to run abc multiple times

Browse source
This commit is contained in:
Ahmet Kaan GÜMÜŞ 2024-11-20 00:20:40 +03:00
parent 5a2100fd30
commit 7d54ed4795
2 changed files with 53 additions and 46 deletions
Download patch file Download diff file Expand all files Collapse all files

4
artificial_bee_colony/src/lib.rs
View file

@ -10,6 +10,7 @@ pub struct Input {
pub upper_bound: f64, pub upper_bound: f64,
pub lower_bound: f64, pub lower_bound: f64,
pub iteration: usize, pub iteration: usize,
pub run: usize,
} }
impl Input { impl Input {
pub fn get() -> Self { pub fn get() -> Self {
@ -31,6 +32,8 @@ impl Input {
println!("Iteration"); println!("Iteration");
let iteration = Self::get_input().parse().unwrap(); let iteration = Self::get_input().parse().unwrap();
println!("Run");
let run = Self::get_input().parse().unwrap();
Input { Input {
decision_variable_count, decision_variable_count,
food_source_number, food_source_number,
@ -38,6 +41,7 @@ impl Input {
upper_bound, upper_bound,
lower_bound, lower_bound,
iteration, iteration,
run,
} }
} }
fn get_input() -> String { fn get_input() -> String {

95
artificial_bee_colony/src/main.rs
View file

@ -10,51 +10,54 @@ fn main() {
input.upper_bound, input.upper_bound,
input.lower_bound, input.lower_bound,
); );
let mut best = FoodSource::get(vec![]);
for food_source in &food_sources {
if best.fitness < food_source.fitness {
best.coordinates = food_source.coordinates.clone();
best.fitness = food_source.fitness;
}
}
for _ in 0..input.iteration {
for index in 0..input.food_source_number as usize {
Bee::worker_bee(
&mut food_sources,
index,
input.decision_variable_count,
input.upper_bound,
input.lower_bound,
);
let mut total_fitness = 0.0;
for food_source in &food_sources {
total_fitness += food_source.fitness;
}
Bee::onlooker_bee(
&mut food_sources,
index,
total_fitness,
input.decision_variable_count,
input.upper_bound,
input.lower_bound,
);
let mut most_tried_index = 0;
for i in 0..food_sources.len() {
if food_sources[most_tried_index].try_counter < food_sources[i].try_counter {
most_tried_index = i;
}
}
best = food_sources[most_tried_index].clone();
Bee::scout_bee(
&mut food_sources,
most_tried_index,
input.food_source_try_limit,
input.lower_bound,
input.upper_bound,
input.decision_variable_count,
);
}
}
println!("{:#?}", best); for _ in 0..input.run {
let mut best = FoodSource::get(vec![]);
for food_source in &food_sources {
if best.fitness < food_source.fitness {
best.coordinates = food_source.coordinates.clone();
best.fitness = food_source.fitness;
}
}
for _ in 0..input.iteration {
for index in 0..input.food_source_number as usize {
Bee::worker_bee(
&mut food_sources,
index,
input.decision_variable_count,
input.upper_bound,
input.lower_bound,
);
let mut total_fitness = 0.0;
for food_source in &food_sources {
total_fitness += food_source.fitness;
}
Bee::onlooker_bee(
&mut food_sources,
index,
total_fitness,
input.decision_variable_count,
input.upper_bound,
input.lower_bound,
);
let mut most_tried_index = 0;
for i in 0..food_sources.len() {
if food_sources[most_tried_index].try_counter < food_sources[i].try_counter {
most_tried_index = i;
}
}
best = food_sources[most_tried_index].clone();
Bee::scout_bee(
&mut food_sources,
most_tried_index,
input.food_source_try_limit,
input.lower_bound,
input.upper_bound,
input.decision_variable_count,
);
}
}
println!("{:#?}", best);
}
} }