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
use super::*;
use crate::construction::heuristics::*;
use rosomaxa::utils::parallel_into_collect;
#[derive(Default)]
pub struct UnassignmentReason {}
impl HeuristicSolutionProcessing for UnassignmentReason {
type Solution = InsertionContext;
fn post_process(&self, solution: Self::Solution) -> Self::Solution {
let mut insertion_ctx = solution;
let unassigned = insertion_ctx.solution.unassigned.drain().collect::<Vec<_>>();
let leg_selector = VariableLegSelector::new(insertion_ctx.environment.random.clone());
let result_selector = BestResultSelector::default();
let unassigned = parallel_into_collect(unassigned, |(job, code)| {
let eval_ctx = EvaluationContext {
constraint: &insertion_ctx.problem.constraint,
job: &job,
leg_selector: &leg_selector,
result_selector: &result_selector,
};
let details = insertion_ctx
.solution
.routes
.iter()
.map(|route_ctx| {
(
route_ctx.route.actor.clone(),
evaluate_job_insertion_in_route(
&insertion_ctx,
&eval_ctx,
route_ctx,
InsertionPosition::Any,
InsertionResult::make_failure(),
),
)
})
.filter_map(|(actor, result)| match &result {
InsertionResult::Failure(failure) => Some((actor, failure.constraint)),
_ => None,
})
.collect::<Vec<_>>();
let code = if details.is_empty() { code } else { UnassignedCode::Detailed(details) };
(job, code)
});
insertion_ctx.solution.unassigned.extend(unassigned.into_iter());
insertion_ctx
}
}