vrp_core/solver/processing/
unassignment_reason.rs

1#[cfg(test)]
2#[path = "../../../tests/unit/solver/processing/unassignment_reason_test.rs"]
3mod unassignment_reason_test;
4
5use super::*;
6use crate::construction::heuristics::*;
7use rosomaxa::utils::{parallel_into_collect, CollectGroupBy};
8
9/// Tries to improve job unassignment reason.
10#[derive(Default)]
11pub struct UnassignmentReason {}
12
13impl HeuristicSolutionProcessing for UnassignmentReason {
14    type Solution = InsertionContext;
15
16    fn post_process(&self, solution: Self::Solution) -> Self::Solution {
17        let mut insertion_ctx = solution;
18
19        let unassigned = insertion_ctx.solution.unassigned.drain().collect::<Vec<_>>();
20        let leg_selection = LegSelection::Exhaustive;
21        let result_selector = BestResultSelector::default();
22
23        let unassigned = parallel_into_collect(unassigned, |(job, code)| {
24            let eval_ctx = EvaluationContext {
25                goal: &insertion_ctx.problem.goal,
26                job: &job,
27                leg_selection: &leg_selection,
28                result_selector: &result_selector,
29            };
30            let details = insertion_ctx
31                .solution
32                .routes
33                .iter()
34                .filter_map(|route_ctx| {
35                    (0..route_ctx.route().tour.legs().count())
36                        .map(|leg_idx| {
37                            eval_job_insertion_in_route(
38                                &insertion_ctx,
39                                &eval_ctx,
40                                route_ctx,
41                                InsertionPosition::Concrete(leg_idx),
42                                InsertionResult::make_failure(),
43                            )
44                        })
45                        .filter_map(|result| match result {
46                            InsertionResult::Failure(failure) => Some(failure),
47                            _ => None,
48                        })
49                        .collect_group_by_key(|code| code.constraint)
50                        .into_iter()
51                        // NOTE: pick only the most frequent reason
52                        .max_by(|(_, a), (_, b)| a.len().cmp(&b.len()))
53                        .map(|(code, _)| (route_ctx.route().actor.clone(), code))
54                })
55                .collect::<Vec<_>>();
56
57            let code = if details.is_empty() { code } else { UnassignmentInfo::Detailed(details) };
58
59            (job, code)
60        });
61
62        insertion_ctx.solution.unassigned.extend(unassigned);
63
64        insertion_ctx
65    }
66}