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
use super::*;
use crate::construction::heuristics::InsertionContext;
use crate::solver::mutation::select_seed_jobs;
use crate::solver::RefinementContext;
pub struct NeighbourRemoval {
limits: RuinLimits,
}
impl NeighbourRemoval {
pub fn new(limits: RuinLimits) -> Self {
Self { limits }
}
}
impl Default for NeighbourRemoval {
fn default() -> Self {
Self::new(RuinLimits::default())
}
}
impl Ruin for NeighbourRemoval {
fn run(&self, _refinement_ctx: &RefinementContext, mut insertion_ctx: InsertionContext) -> InsertionContext {
let problem = insertion_ctx.problem.clone();
let random = insertion_ctx.environment.random.clone();
let routes = insertion_ctx.solution.routes.clone();
let locked = insertion_ctx.solution.locked.clone();
let max_affected = self.limits.get_chunk_size(&insertion_ctx);
let tracker = self.limits.get_tracker();
select_seed_jobs(&problem, &routes, &random)
.filter(|job| !locked.contains(job))
.take_while(|_| tracker.is_not_limit(max_affected))
.for_each(|job| {
let route = insertion_ctx.solution.routes.iter_mut().find(|rc| rc.route.tour.contains(&job));
if let Some(rc) = route {
rc.route_mut().tour.remove(&job);
insertion_ctx.solution.required.push(job.clone());
tracker.add_actor(rc.route.actor.clone());
tracker.add_job(job);
}
});
insertion_ctx
}
}