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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
use crate::construction::heuristics::*;
use crate::construction::Quota;
use crate::models::common::Cost;
use crate::models::problem::Job;
use crate::models::solution::Activity;
use std::sync::Arc;
pub enum InsertionResult {
Success(InsertionSuccess),
Failure(InsertionFailure),
}
pub struct InsertionSuccess {
pub cost: Cost,
pub job: Job,
pub activities: Vec<(Activity, usize)>,
pub context: RouteContext,
}
pub struct InsertionFailure {
pub constraint: i32,
pub stopped: bool,
pub job: Option<Job>,
}
pub struct InsertionHeuristic {
insertion_evaluator: Box<dyn InsertionEvaluator + Send + Sync>,
}
impl Default for InsertionHeuristic {
fn default() -> Self {
InsertionHeuristic::new(Box::new(PositionInsertionEvaluator::default()))
}
}
impl InsertionHeuristic {
pub fn new(insertion_evaluator: Box<dyn InsertionEvaluator + Send + Sync>) -> Self {
Self { insertion_evaluator }
}
}
impl InsertionHeuristic {
pub fn process(
&self,
ctx: InsertionContext,
job_selector: &(dyn JobSelector + Send + Sync),
route_selector: &(dyn RouteSelector + Send + Sync),
result_selector: &(dyn ResultSelector + Send + Sync),
quota: &Option<Arc<dyn Quota + Send + Sync>>,
) -> InsertionContext {
let mut ctx = ctx;
prepare_insertion_ctx(&mut ctx);
while !ctx.solution.required.is_empty() && !quota.as_ref().map_or(false, |q| q.is_reached()) {
let jobs = job_selector.select(&mut ctx).collect::<Vec<Job>>();
let routes = route_selector.select(&mut ctx, jobs.as_slice()).collect::<Vec<RouteContext>>();
let result =
self.insertion_evaluator.evaluate_all(&ctx, jobs.as_slice(), routes.as_slice(), result_selector);
apply_insertion_result(&mut ctx, result);
}
finalize_insertion_ctx(&mut ctx);
ctx
}
}
impl InsertionResult {
pub fn make_success(cost: Cost, job: Job, activities: Vec<(Activity, usize)>, route_ctx: RouteContext) -> Self {
Self::Success(InsertionSuccess { cost, job, activities, context: route_ctx })
}
pub fn make_failure() -> Self {
Self::make_failure_with_code(-1, false, None)
}
pub fn make_failure_with_code(code: i32, stopped: bool, job: Option<Job>) -> Self {
Self::Failure(InsertionFailure { constraint: code, stopped, job })
}
pub fn choose_best_result(left: Self, right: Self) -> Self {
match (&left, &right) {
(Self::Success(_), Self::Failure(_)) => left,
(Self::Failure(_), Self::Success(_)) => right,
(Self::Success(lhs), Self::Success(rhs)) => {
if lhs.cost > rhs.cost {
right
} else {
left
}
}
_ => right,
}
}
}
pub(crate) fn prepare_insertion_ctx(ctx: &mut InsertionContext) {
ctx.solution.required.extend(ctx.solution.unassigned.iter().map(|(job, _)| job.clone()));
ctx.problem.constraint.accept_solution_state(&mut ctx.solution);
}
pub(crate) fn finalize_insertion_ctx(ctx: &mut InsertionContext) {
finalize_unassigned(ctx, -1);
ctx.problem.constraint.accept_solution_state(&mut ctx.solution);
}
pub(crate) fn apply_insertion_result(ctx: &mut InsertionContext, result: InsertionResult) {
match result {
InsertionResult::Success(success) => {
let is_new_route = ctx.solution.registry.use_route(&success.context);
let route_index = ctx.solution.routes.iter().position(|ctx| ctx == &success.context).unwrap_or_else(|| {
assert!(is_new_route);
ctx.solution.routes.push(success.context.deep_copy());
ctx.solution.routes.len() - 1
});
let route_ctx = ctx.solution.routes.get_mut(route_index).unwrap();
let route = route_ctx.route_mut();
success.activities.into_iter().for_each(|(a, index)| {
route.tour.insert_at(a, index + 1);
});
let job = success.job;
ctx.solution.required.retain(|j| *j != job);
ctx.solution.unassigned.remove(&job);
ctx.problem.constraint.accept_insertion(&mut ctx.solution, route_index, &job);
}
InsertionResult::Failure(failure) => {
if let Some(job) = failure.job {
ctx.solution.unassigned.insert(job.clone(), failure.constraint);
ctx.solution.required.retain(|j| *j != job);
} else {
finalize_unassigned(ctx, failure.constraint)
}
}
}
}
fn finalize_unassigned(ctx: &mut InsertionContext, code: i32) {
let unassigned = &ctx.solution.unassigned;
ctx.solution.required.retain(|job| !unassigned.contains_key(job));
ctx.solution.unassigned.extend(ctx.solution.required.drain(0..).map(|job| (job, code)));
}