vrp_core/solver/search/local/
reschedule_departure.rs1use crate::construction::enablers::{advance_departure_time, recede_departure_time};
2use crate::construction::heuristics::InsertionContext;
3use crate::models::solution::Activity;
4use crate::solver::search::LocalOperator;
5use crate::solver::RefinementContext;
6use rosomaxa::prelude::*;
7
8#[derive(Default)]
10pub struct RescheduleDeparture {}
11
12impl LocalOperator for RescheduleDeparture {
13 fn explore(
14 &self,
15 refinement_ctx: &RefinementContext,
16 insertion_ctx: &InsertionContext,
17 ) -> Option<InsertionContext> {
18 let activity = refinement_ctx.problem.activity.as_ref();
19 let transport = refinement_ctx.problem.transport.as_ref();
20
21 let random = insertion_ctx.environment.random.clone();
24 let consider_whole_tour = true;
25
26 let mut insertion_ctx = insertion_ctx.deep_copy();
27 insertion_ctx.solution.routes.iter_mut().for_each(|route_ctx| {
28 let earliest = route_ctx.route().actor.detail.start.as_ref().and_then(|start| start.time.earliest);
29
30 match (route_ctx.route().tour.start(), earliest, random.is_head_not_tails()) {
31 (Some(start), Some(earliest), true) if can_recede_departure(start, earliest) => {
32 recede_departure_time(route_ctx, activity, transport)
33 }
34 _ => advance_departure_time(route_ctx, activity, transport, consider_whole_tour),
35 };
36 });
37
38 refinement_ctx.problem.goal.accept_solution_state(&mut insertion_ctx.solution);
41
42 Some(insertion_ctx)
43 }
44}
45
46fn can_recede_departure(start: &Activity, earliest: Float) -> bool {
47 start.schedule.departure != earliest
48}