Struct NearbyKOptMoveSelector 

pub struct NearbyKOptMoveSelector<S, V, D: ListPositionDistanceMeter<S>, ES> { /* private fields */ }

A k-opt move selector with nearby selection for improved performance.

Instead of enumerating all O(n^k) cut combinations, uses distance-based pruning to reduce to O(n * m^(k-1)) where m = max_nearby_size.

How It Works

1. First cut: all positions in the route
2. Second cut: only positions nearby (by element distance) to first cut
3. Third cut: only positions nearby to second cut
4. etc.

This dramatically reduces the search space for large routes.

Implementations

impl<S: PlanningSolution, V, D: ListPositionDistanceMeter<S>, ES> NearbyKOptMoveSelector<S, V, D, ES>

pub fn new( entity_selector: ES, distance_meter: D, max_nearby: usize, config: KOptConfig, list_len: fn(&S, usize) -> usize, sublist_remove: fn(&mut S, usize, usize, usize) -> Vec<V>, sublist_insert: fn(&mut S, usize, usize, Vec<V>), variable_name: &'static str, descriptor_index: usize, ) -> Self

Trait Implementations

impl<S, V: Debug, D: ListPositionDistanceMeter<S>, ES: Debug> Debug for NearbyKOptMoveSelector<S, V, D, ES>

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

Formats the value using the given formatter.

impl<S, V, DM, ES> MoveSelector<S, KOptMove<S, V>> for NearbyKOptMoveSelector<S, V, DM, ES>

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

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

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

fn is_never_ending(&self) -> bool