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

use crate::construction::constraints::TransportConstraintModule;
use crate::construction::heuristics::InsertionContext;
use crate::models::solution::Activity;
use crate::solver::mutation::LocalOperator;
use crate::solver::RefinementContext;
use crate::utils::compare_floats;
use std::cmp::Ordering;

/// Reschedules departure time of the routes in the solution.
pub struct RescheduleDeparture {}

impl Default for RescheduleDeparture {
    fn default() -> Self {
        Self {}
    }
}

impl LocalOperator for RescheduleDeparture {
    fn explore(
        &self,
        refinement_ctx: &RefinementContext,
        insertion_ctx: &InsertionContext,
    ) -> Option<InsertionContext> {
        let transport = refinement_ctx.problem.transport.as_ref();

        // TODO optionally, optimize only subset of the routes.

        let random = insertion_ctx.environment.random.clone();

        let mut insertion_ctx = insertion_ctx.deep_copy();
        insertion_ctx.solution.routes.iter_mut().for_each(|route_ctx| {
            let earliest = route_ctx.route.actor.detail.start.as_ref().and_then(|start| start.time.earliest);

            match (route_ctx.route.tour.start(), earliest, random.is_head_not_tails()) {
                (Some(start), Some(earliest), true) if can_recede_departure(start, earliest) => {
                    TransportConstraintModule::recede_departure_time(route_ctx, transport)
                }
                _ => TransportConstraintModule::advance_departure_time(route_ctx, transport, true),
            };
        });

        // TODO check is_stale flag and return None

        refinement_ctx.problem.constraint.accept_solution_state(&mut insertion_ctx.solution);

        Some(insertion_ctx)
    }
}

fn can_recede_departure(start: &Activity, earliest: f64) -> bool {
    compare_floats(start.schedule.departure, earliest) != Ordering::Equal
}