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
use crate::construction::heuristics::InsertionContext;
use crate::construction::heuristics::*;
use crate::solver::mutation::recreate::Recreate;
use crate::solver::mutation::ConfigurableRecreate;
use crate::solver::RefinementContext;
pub struct RecreateWithFarthest {
recreate: ConfigurableRecreate,
}
impl Default for RecreateWithFarthest {
fn default() -> Self {
Self {
recreate: ConfigurableRecreate::new(
Box::new(AllJobSelector::default()),
Box::new(AllRouteSelector::default()),
Box::new(FarthestResultSelector {}),
Default::default(),
),
}
}
}
impl Recreate for RecreateWithFarthest {
fn run(&self, refinement_ctx: &RefinementContext, insertion_ctx: InsertionContext) -> InsertionContext {
self.recreate.run(refinement_ctx, insertion_ctx)
}
}
struct FarthestResultSelector {}
impl ResultSelector for FarthestResultSelector {
fn select_insertion(&self, _: &InsertionContext, left: InsertionResult, right: InsertionResult) -> InsertionResult {
match (&left, &right) {
(InsertionResult::Success(_), InsertionResult::Failure(_)) => left,
(InsertionResult::Failure(_), InsertionResult::Success(_)) => right,
(InsertionResult::Success(lhs), InsertionResult::Success(rhs)) => {
let insert_right = match (lhs.context.route.tour.has_jobs(), rhs.context.route.tour.has_jobs()) {
(false, false) => lhs.cost < rhs.cost,
(true, false) => false,
(false, true) => true,
(true, true) => lhs.cost > rhs.cost,
};
if insert_right {
right
} else {
left
}
}
_ => right,
}
}
}