solverforge-solver 0.8.5

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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

// Local search phase factory with zero type erasure.

use std::marker::PhantomData;

use solverforge_core::domain::PlanningSolution;
use solverforge_scoring::Director;

use crate::heuristic::{Move, MoveSelector};
use crate::phase::localsearch::{
    AcceptedCountForager, Acceptor, HillClimbingAcceptor, LateAcceptanceAcceptor,
    LocalSearchForager, LocalSearchPhase, SimulatedAnnealingAcceptor, TabuSearchAcceptor,
};

use super::super::PhaseFactory;

/// Zero-erasure factory for local search phases.
///
/// All types flow through generics - MoveSelector `MS`, Acceptor `A`,
/// and Forager `Fo` are all concrete types.
///
/// # Type Parameters
///
/// * `S` - The planning solution type
/// * `M` - The move type
/// * `MS` - The move selector type (concrete)
/// * `A` - The acceptor type (concrete)
/// * `Fo` - The forager type (concrete)
pub struct LocalSearchPhaseFactory<S, M, MS, A, Fo>
where
    S: PlanningSolution,
    M: Move<S>,
    MS: MoveSelector<S, M>,
    A: Acceptor<S>,
    Fo: LocalSearchForager<S, M>,
{
    move_selector: MS,
    acceptor: A,
    forager: Fo,
    step_limit: Option<u64>,
    _marker: PhantomData<fn() -> (S, M)>,
}

impl<S, M, MS, A, Fo> LocalSearchPhaseFactory<S, M, MS, A, Fo>
where
    S: PlanningSolution,
    M: Move<S>,
    MS: MoveSelector<S, M>,
    A: Acceptor<S>,
    Fo: LocalSearchForager<S, M>,
{
    pub fn new(move_selector: MS, acceptor: A, forager: Fo) -> Self {
        Self {
            move_selector,
            acceptor,
            forager,
            step_limit: None,
            _marker: PhantomData,
        }
    }

    pub fn with_step_limit(mut self, limit: u64) -> Self {
        self.step_limit = Some(limit);
        self
    }
}

// Convenience constructors with specific acceptors

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, HillClimbingAcceptor, AcceptedCountForager<S>>
where
    S: PlanningSolution,
    M: Move<S>,
    MS: MoveSelector<S, M>,
{
    pub fn hill_climbing(move_selector: MS) -> Self {
        Self::new(
            move_selector,
            HillClimbingAcceptor::new(),
            AcceptedCountForager::new(1),
        )
    }
}

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, TabuSearchAcceptor<S>, AcceptedCountForager<S>>
where
    S: PlanningSolution,
    M: Move<S>,
    MS: MoveSelector<S, M>,
{
    pub fn tabu_search(move_selector: MS, tabu_size: usize) -> Self {
        Self::new(
            move_selector,
            TabuSearchAcceptor::new(tabu_size),
            AcceptedCountForager::new(1),
        )
    }
}

impl<S, M, MS>
    LocalSearchPhaseFactory<S, M, MS, SimulatedAnnealingAcceptor, AcceptedCountForager<S>>
where
    S: PlanningSolution,
    M: Move<S>,
    MS: MoveSelector<S, M>,
{
    pub fn simulated_annealing(move_selector: MS, starting_temp: f64, decay_rate: f64) -> Self {
        Self::new(
            move_selector,
            SimulatedAnnealingAcceptor::new(starting_temp, decay_rate),
            AcceptedCountForager::new(1),
        )
    }
}

impl<S, M, MS> LocalSearchPhaseFactory<S, M, MS, LateAcceptanceAcceptor<S>, AcceptedCountForager<S>>
where
    S: PlanningSolution,
    M: Move<S>,
    MS: MoveSelector<S, M>,
{
    pub fn late_acceptance(move_selector: MS, size: usize) -> Self {
        Self::new(
            move_selector,
            LateAcceptanceAcceptor::new(size),
            AcceptedCountForager::new(1),
        )
    }
}

impl<S, D, M, MS, A, Fo> PhaseFactory<S, D> for LocalSearchPhaseFactory<S, M, MS, A, Fo>
where
    S: PlanningSolution,
    D: Director<S>,
    M: Move<S> + Send + Sync + 'static,
    MS: MoveSelector<S, M> + Clone + Send + Sync + 'static,
    A: Acceptor<S> + Clone + Send + Sync + 'static,
    Fo: LocalSearchForager<S, M> + Clone + Send + Sync + 'static,
{
    type Phase = LocalSearchPhase<S, M, MS, A, Fo>;

    fn create(&self) -> Self::Phase {
        LocalSearchPhase::new(
            self.move_selector.clone(),
            self.acceptor.clone(),
            self.forager.clone(),
            self.step_limit,
        )
    }
}