Struct ListReverseMove 

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

A move that reverses a segment within a list.

This is the fundamental 2-opt move for TSP. Reversing a segment of the tour can significantly reduce total distance by eliminating crossing edges.

Type Parameters

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

Example

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

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

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

fn list_len(s: &Tour, _: usize) -> usize { s.cities.len() }
fn list_reverse(s: &mut Tour, _: usize, start: usize, end: usize) {
    s.cities[start..end].reverse();
}

// Reverse segment [1..4) in tour: [A, B, C, D, E] -> [A, D, C, B, E]
let m = ListReverseMove::<Tour, i32>::new(
    0, 1, 4,
    list_len, list_reverse,
    "cities", 0,
);

Implementations

impl<S, V> ListReverseMove<S, V>

pub fn new( entity_index: usize, start: usize, end: usize, list_len: fn(&S, usize) -> usize, list_reverse: fn(&mut S, usize, usize, usize), variable_name: &'static str, descriptor_index: usize, ) -> Self

pub fn entity_index(&self) -> usize

pub fn start(&self) -> usize

pub fn end(&self) -> usize

pub fn segment_len(&self) -> usize

Trait Implementations

impl<S, V> Clone for ListReverseMove<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 ListReverseMove<S, V>

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

Formats the value using the given formatter.

impl<S, V> Move<S> for ListReverseMove<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, ES> MoveSelector<S, ListReverseMove<S, V>> for ListReverseMoveSelector<S, V, ES>

where S: PlanningSolution, V: Clone + Send + Sync + Debug + 'static, ES: EntitySelector<S>,

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

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

fn is_never_ending(&self) -> bool

impl<S, V> Copy for ListReverseMove<S, V>