solverforge-solver 0.11.1

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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

// Hill climbing acceptor.

use std::fmt::Debug;

use solverforge_core::domain::PlanningSolution;

use super::Acceptor;
use crate::heuristic::r#move::MoveTabuSignature;

/* Hill climbing acceptor - accepts only improving moves.

This is the simplest acceptor. It only accepts moves that result
in a strictly better score. This can get stuck in local optima.

# Example

```
use solverforge_solver::phase::localsearch::HillClimbingAcceptor;

let acceptor = HillClimbingAcceptor::new();
```
*/
#[derive(Debug, Clone, Default)]
pub struct HillClimbingAcceptor;

impl HillClimbingAcceptor {
    pub fn new() -> Self {
        Self
    }
}

impl<S: PlanningSolution> Acceptor<S> for HillClimbingAcceptor {
    fn is_accepted(
        &mut self,
        last_step_score: &S::Score,
        move_score: &S::Score,
        _move_signature: Option<&MoveTabuSignature>,
    ) -> bool {
        // Accept if the move score is better than the last step score
        move_score > last_step_score
    }
}