vrp-core 1.23.0

A core algorithms to solve a Vehicle Routing Problem
Documentation 
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

use super::*;
use crate::construction::enablers::{advance_departure_time, ScheduleKeys};
use crate::construction::heuristics::InsertionContext;
use rosomaxa::HeuristicSolution;

/// Provides way to reduce waiting time by advancing departure time.
pub struct AdvanceDeparture {
    state_keys: ScheduleKeys,
}

impl AdvanceDeparture {
    /// Creates an instance of `AdvanceDeparture`.
    pub fn new(state_keys: ScheduleKeys) -> Self {
        Self { state_keys }
    }
}

impl HeuristicSolutionProcessing for AdvanceDeparture {
    type Solution = InsertionContext;

    fn post_process(&self, solution: Self::Solution) -> Self::Solution {
        let mut insertion_ctx = solution.deep_copy();

        let problem = insertion_ctx.problem.clone();

        let activity = problem.activity.as_ref();
        let transport = problem.transport.as_ref();

        insertion_ctx.solution.routes.iter_mut().for_each(|route_ctx| {
            advance_departure_time(route_ctx, activity, transport, true, &self.state_keys);
        });

        problem.goal.accept_solution_state(&mut insertion_ctx.solution);

        insertion_ctx
    }
}