Struct LocalSearchPhase 

pub struct LocalSearchPhase<S, M>
where
    S: PlanningSolution,
    M: Move<S>,
{ /* private fields */ }

Local search phase that improves an existing solution.

This phase iteratively:

1. Generates candidate moves
2. Evaluates each move
3. Accepts/rejects based on the acceptor
4. Applies the best accepted move

Type Parameters

• S - The planning solution type
• M - The move type (must implement Move<S> + Clone)

Performance

Uses MoveArena<M> for O(1) per-step cleanup instead of allocating a new Vec each step.

Implementations

impl<S, M> LocalSearchPhase<S, M>

where S: PlanningSolution, M: Move<S> + 'static,

pub fn new( move_selector: Box<dyn MoveSelector<S, M>>, acceptor: Box<dyn Acceptor<S>>, forager: Box<dyn LocalSearchForager<S, M>>, step_limit: Option<u64>, ) -> Self

Creates a new local search phase.

Trait Implementations

impl<S, M> Debug for LocalSearchPhase<S, M>

where S: PlanningSolution, M: Move<S>,

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

Formats the value using the given formatter.

impl<S, M> Phase<S> for LocalSearchPhase<S, M>

where S: PlanningSolution, M: Move<S>,

fn solve(&mut self, solver_scope: &mut SolverScope<S>)

Executes this phase.

fn phase_type_name(&self) -> &'static str

Returns the name of this phase type.