use crate::construction::enablers::{advance_departure_time, recede_departure_time, ScheduleKeys};
use crate::construction::heuristics::InsertionContext;
use crate::models::solution::Activity;
use crate::solver::search::LocalOperator;
use crate::solver::RefinementContext;
use rosomaxa::prelude::*;
use std::cmp::Ordering;
pub struct RescheduleDeparture {
state_keys: ScheduleKeys,
}
impl RescheduleDeparture {
pub fn new(state_keys: ScheduleKeys) -> Self {
Self { state_keys }
}
}
impl LocalOperator for RescheduleDeparture {
fn explore(
&self,
refinement_ctx: &RefinementContext,
insertion_ctx: &InsertionContext,
) -> Option<InsertionContext> {
let activity = refinement_ctx.problem.activity.as_ref();
let transport = refinement_ctx.problem.transport.as_ref();
let random = insertion_ctx.environment.random.clone();
let consider_whole_tour = true;
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) => {
recede_departure_time(route_ctx, activity, transport, &self.state_keys)
}
_ => advance_departure_time(route_ctx, activity, transport, consider_whole_tour, &self.state_keys),
};
});
refinement_ctx.problem.goal.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
}