Struct vrp_core::solver::mutation::WorstJobRemoval [−][src]
pub struct WorstJobRemoval { /* fields omitted */ }Expand description
A ruin strategy which detects the most cost expensive jobs in each route and delete them with their neighbours.
Implementations
impl WorstJobRemoval[src]
impl WorstJobRemoval[src]pub fn new(worst_skip: usize, limits: RuinLimits) -> Self[src]
pub fn new(worst_skip: usize, limits: RuinLimits) -> Self[src]Creates a new instance of WorstJobRemoval.
Trait Implementations
impl Default for WorstJobRemoval[src]
impl Default for WorstJobRemoval[src]impl Ruin for WorstJobRemoval[src]
impl Ruin for WorstJobRemoval[src]fn run(
&self,
_refinement_ctx: &RefinementContext,
insertion_ctx: InsertionContext
) -> InsertionContext[src]
fn run(
&self,
_refinement_ctx: &RefinementContext,
insertion_ctx: InsertionContext
) -> InsertionContext[src]Ruins given solution and returns a new one with less jobs assigned.
Auto Trait Implementations
impl RefUnwindSafe for WorstJobRemoval
impl Send for WorstJobRemoval
impl Sync for WorstJobRemoval
impl Unpin for WorstJobRemoval
impl UnwindSafe for WorstJobRemoval
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]pub fn borrow_mut(&mut self) -> &mut T[src]
pub fn borrow_mut(&mut self) -> &mut T[src]Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for Timpl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,