Struct ListRuinMove 

pub struct ListRuinMove<S, V> { /* private fields */ }

A ruin-and-recreate move for Large Neighborhood Search on list variables.

Removes selected elements from a source entity, then reinserts each one greedily into the best position across all entities (including the source). The move is self-contained: accepting it leaves the solution valid.

Type Parameters

• S - The planning solution type
• V - The list element value type

Example

use solverforge_solver::heuristic::r#move::ListRuinMove;
use solverforge_core::domain::PlanningSolution;
use solverforge_core::score::SoftScore;

#[derive(Clone, Debug)]
struct Route { stops: Vec<i32>, score: Option<SoftScore> }

impl PlanningSolution for Route {
    type Score = SoftScore;
    fn score(&self) -> Option<Self::Score> { self.score }
    fn set_score(&mut self, score: Option<Self::Score>) { self.score = score; }
}

fn entity_count(s: &Route) -> usize { 1 }
fn list_len(s: &Route, _: usize) -> usize { s.stops.len() }
fn list_remove(s: &mut Route, _: usize, idx: usize) -> i32 { s.stops.remove(idx) }
fn list_insert(s: &mut Route, _: usize, idx: usize, v: i32) { s.stops.insert(idx, v); }

// Ruin elements at indices 1 and 3, then recreate greedily
let m = ListRuinMove::<Route, i32>::new(
    0,
    &[1, 3],
    entity_count,
    list_len, list_remove, list_insert,
    "stops", 0,
);

Implementations

impl<S, V> ListRuinMove<S, V>

pub fn new( entity_index: usize, element_indices: &[usize], entity_count: fn(&S) -> usize, list_len: fn(&S, usize) -> usize, list_remove: fn(&mut S, usize, usize) -> V, list_insert: fn(&mut S, usize, usize, V), variable_name: &'static str, descriptor_index: usize, ) -> Self

pub fn entity_index(&self) -> usize

pub fn element_indices(&self) -> &[usize]

pub fn ruin_count(&self) -> usize

Trait Implementations

impl<S, V> Clone for ListRuinMove<S, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S, V: Debug> Debug for ListRuinMove<S, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<S, V> Move<S> for ListRuinMove<S, V>

where S: PlanningSolution, V: Clone + Send + Sync + Debug + 'static,

fn is_doable<D: Director<S>>(&self, score_director: &D) -> bool

fn do_move<D: Director<S>>(&self, score_director: &mut D)

fn descriptor_index(&self) -> usize

fn entity_indices(&self) -> &[usize]

fn variable_name(&self) -> &str

impl<S, V> MoveSelector<S, ListRuinMove<S, V>> for ListRuinMoveSelector<S, V>

where S: PlanningSolution, V: Clone + Send + Sync + Debug + 'static,

fn iter_moves<'a, D: Director<S>>( &'a self, score_director: &'a D, ) -> impl Iterator<Item = ListRuinMove<S, V>> + 'a

fn size<D: Director<S>>(&self, score_director: &D) -> usize

fn is_never_ending(&self) -> bool