solverforge-solver 0.8.6

Solver engine for SolverForge
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

// Acceptor trait definition.

use std::fmt::Debug;

use solverforge_core::domain::PlanningSolution;

/// Trait for accepting or rejecting moves in local search.
///
/// Acceptors implement different strategies for escaping local optima,
/// such as hill climbing, simulated annealing, or tabu search.
pub trait Acceptor<S: PlanningSolution>: Send + Debug {
    // Returns true if a move resulting in `move_score` should be accepted,
    // given the previous step's score.
    fn is_accepted(&mut self, last_step_score: &S::Score, move_score: &S::Score) -> bool;

    // Called when a phase starts.
    fn phase_started(&mut self, _initial_score: &S::Score) {}

    // Called when a phase ends.
    fn phase_ended(&mut self) {}

    // Called when a step starts.
    fn step_started(&mut self) {}

    // Called when a step ends with an accepted move.
    fn step_ended(&mut self, _step_score: &S::Score) {}
}