Struct SaRunner 

pub struct SaRunner<P: SaProblem> { /* private fields */ }

Simulated Annealing runner.

Implementations

impl<P: SaProblem> SaRunner<P>

pub fn new(config: SaConfig, problem: P) -> Self

Creates a new SA runner.

pub fn cancel_handle(&self) -> Arc<AtomicBool>

Returns a handle to cancel the algorithm.

pub fn run(&self) -> SaResult<P::Solution>

Runs the Simulated Annealing algorithm.

pub fn run_with_rng<R: Rng>(&self, rng: &mut R) -> SaResult<P::Solution>

Runs the Simulated Annealing algorithm with a specific RNG.

pub fn run_parallel(&self, num_restarts: usize) -> SaResult<P::Solution>

where P: Clone,

Runs multiple SA instances in parallel and returns the best result.

This is useful for escaping local optima by exploring different regions of the solution space simultaneously.

Arguments

• num_restarts - Number of parallel SA runs to perform

Returns

The best result among all parallel runs