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
use crate::construction::heuristics::InsertionContext;
use crate::construction::heuristics::*;
use crate::models::problem::Job;
use crate::solver::mutation::recreate::Recreate;
use crate::solver::RefinementContext;
use rand::prelude::*;
struct GapsJobSelector {
min_jobs: usize,
}
impl JobSelector for GapsJobSelector {
fn select<'a>(&'a self, ctx: &'a mut InsertionContext) -> Box<dyn Iterator<Item = Job> + 'a> {
ctx.solution.required.shuffle(&mut ctx.random.get_rng());
let max_jobs = self.min_jobs.max(ctx.solution.required.len());
let take_jobs = ctx.random.uniform_int(self.min_jobs as i32, max_jobs as i32) as usize;
Box::new(ctx.solution.required.iter().take(take_jobs).cloned())
}
}
pub struct RecreateWithGaps {
route_selector: Box<dyn RouteSelector + Send + Sync>,
job_selector: Box<dyn JobSelector + Send + Sync>,
job_reducer: Box<dyn JobMapReducer + Send + Sync>,
}
impl RecreateWithGaps {
pub fn new(min_jobs: usize) -> Self {
Self {
route_selector: Box::new(AllRouteSelector::default()),
job_selector: Box::new(GapsJobSelector { min_jobs }),
job_reducer: Box::new(PairJobMapReducer::new(Box::new(BestResultSelector::default()))),
}
}
}
impl Default for RecreateWithGaps {
fn default() -> Self {
Self::new(2)
}
}
impl Recreate for RecreateWithGaps {
fn run(&self, refinement_ctx: &RefinementContext, insertion_ctx: InsertionContext) -> InsertionContext {
InsertionHeuristic::default().process(
self.route_selector.as_ref(),
self.job_selector.as_ref(),
self.job_reducer.as_ref(),
insertion_ctx,
&refinement_ctx.quota,
)
}
}