Skip to main content

solverforge_solver/phase/localsearch/
phase.rs

1// Local search phase implementation.
2
3use std::fmt::Debug;
4use std::marker::PhantomData;
5use std::time::Instant;
6
7use solverforge_core::domain::PlanningSolution;
8use solverforge_scoring::{Director, RecordingDirector};
9use tracing::{debug, info, trace};
10
11use crate::heuristic::r#move::Move;
12use crate::heuristic::selector::move_selector::MoveCursor;
13use crate::heuristic::selector::MoveSelector;
14use crate::phase::control::{
15    settle_search_interrupt, should_interrupt_evaluation, should_interrupt_generation,
16    StepInterrupt,
17};
18use crate::phase::localsearch::{Acceptor, LocalSearchForager};
19use crate::phase::Phase;
20use crate::scope::ProgressCallback;
21use crate::scope::{PhaseScope, SolverScope, StepScope};
22use crate::stats::{format_duration, whole_units_per_second};
23
24/// Local search phase that improves an existing solution.
25///
26/// This phase iteratively:
27/// 1. Generates candidate moves into an arena
28/// 2. Evaluates each move by index
29/// 3. Accepts/rejects based on the acceptor
30/// 4. Takes ownership of the best accepted move from arena
31///
32/// # Type Parameters
33/// * `S` - The planning solution type
34/// * `M` - The move type
35/// * `MS` - The move selector type
36/// * `A` - The acceptor type
37/// * `Fo` - The forager type
38///
39/// # Zero-Clone Design
40///
41/// Uses index-based foraging. The forager stores `(usize, Score)` pairs.
42/// When a move is selected, ownership transfers via `arena.take(index)`.
43/// Moves are NEVER cloned.
44pub struct LocalSearchPhase<S, M, MS, A, Fo>
45where
46    S: PlanningSolution,
47    M: Move<S>,
48    MS: MoveSelector<S, M>,
49    A: Acceptor<S>,
50    Fo: LocalSearchForager<S, M>,
51{
52    move_selector: MS,
53    acceptor: A,
54    forager: Fo,
55    step_limit: Option<u64>,
56    _phantom: PhantomData<fn() -> (S, M)>,
57}
58
59impl<S, M, MS, A, Fo> LocalSearchPhase<S, M, MS, A, Fo>
60where
61    S: PlanningSolution,
62    M: Move<S> + 'static,
63    MS: MoveSelector<S, M>,
64    A: Acceptor<S>,
65    Fo: LocalSearchForager<S, M>,
66{
67    pub fn new(move_selector: MS, acceptor: A, forager: Fo, step_limit: Option<u64>) -> Self {
68        Self {
69            move_selector,
70            acceptor,
71            forager,
72            step_limit,
73            _phantom: PhantomData,
74        }
75    }
76}
77
78impl<S, M, MS, A, Fo> Debug for LocalSearchPhase<S, M, MS, A, Fo>
79where
80    S: PlanningSolution,
81    M: Move<S>,
82    MS: MoveSelector<S, M> + Debug,
83    A: Acceptor<S> + Debug,
84    Fo: LocalSearchForager<S, M> + Debug,
85{
86    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
87        f.debug_struct("LocalSearchPhase")
88            .field("move_selector", &self.move_selector)
89            .field("acceptor", &self.acceptor)
90            .field("forager", &self.forager)
91            .field("step_limit", &self.step_limit)
92            .finish()
93    }
94}
95
96impl<S, D, BestCb, M, MS, A, Fo> Phase<S, D, BestCb> for LocalSearchPhase<S, M, MS, A, Fo>
97where
98    S: PlanningSolution,
99    D: Director<S>,
100    BestCb: ProgressCallback<S>,
101    M: Move<S>,
102    MS: MoveSelector<S, M>,
103    A: Acceptor<S>,
104    Fo: LocalSearchForager<S, M>,
105{
106    fn solve(&mut self, solver_scope: &mut SolverScope<S, D, BestCb>) {
107        let mut phase_scope = PhaseScope::new(solver_scope, 0);
108        let phase_index = phase_scope.phase_index();
109
110        // Calculate initial score
111        let mut last_step_score = phase_scope.calculate_score();
112
113        info!(
114            event = "phase_start",
115            phase = "Local Search",
116            phase_index = phase_index,
117        );
118
119        // Notify acceptor of phase start
120        self.acceptor.phase_started(&last_step_score);
121
122        let start_time = Instant::now();
123        let mut local_moves_generated: u64 = 0;
124        let mut local_moves_evaluated: u64 = 0;
125        let mut last_progress_time = Instant::now();
126        let mut last_progress_moves: u64 = 0;
127        loop {
128            // Check early termination
129            if phase_scope.solver_scope_mut().should_terminate() {
130                break;
131            }
132
133            // Check step limit
134            if let Some(limit) = self.step_limit {
135                if phase_scope.step_count() >= limit {
136                    break;
137                }
138            }
139
140            let mut step_scope = StepScope::new(&mut phase_scope);
141
142            /* Reset forager and acceptor for this step.
143            Pass best and last-step scores so foragers that implement
144            pick-early-on-improvement strategies know their reference targets.
145            */
146            let best_score = step_scope
147                .phase_scope()
148                .solver_scope()
149                .best_score()
150                .copied()
151                .unwrap_or(last_step_score);
152            self.forager.step_started(best_score, last_step_score);
153            self.acceptor.step_started();
154            let requires_move_signatures = self.acceptor.requires_move_signatures();
155
156            let mut interrupted_step = false;
157            let mut generated_moves = 0usize;
158            let mut evaluated_moves = 0usize;
159            let generation_started = Instant::now();
160            let mut cursor = self.move_selector.open_cursor(step_scope.score_director());
161            step_scope
162                .phase_scope_mut()
163                .record_generation_time(generation_started.elapsed());
164
165            while !self.forager.is_quit_early() {
166                if should_interrupt_generation(&step_scope, generated_moves) {
167                    interrupted_step = true;
168                    break;
169                }
170
171                let generation_started = Instant::now();
172                let Some((candidate_index, mov)) = cursor.next_candidate() else {
173                    break;
174                };
175                let generation_elapsed = generation_started.elapsed();
176                generated_moves += 1;
177                local_moves_generated += 1;
178                step_scope
179                    .phase_scope_mut()
180                    .record_generated_move(generation_elapsed);
181
182                if should_interrupt_evaluation(&step_scope, evaluated_moves) {
183                    interrupted_step = true;
184                    break;
185                }
186                evaluated_moves += 1;
187                local_moves_evaluated += 1;
188
189                if local_moves_evaluated & 0x1FFF == 0 {
190                    let now = Instant::now();
191                    if now.duration_since(last_progress_time).as_secs() >= 1 {
192                        let current_speed = whole_units_per_second(
193                            local_moves_evaluated - last_progress_moves,
194                            now.duration_since(last_progress_time),
195                        );
196                        debug!(
197                            event = "progress",
198                            steps = step_scope.step_index(),
199                            moves_generated = local_moves_generated,
200                            moves_evaluated = local_moves_evaluated,
201                            moves_accepted = step_scope.phase_scope().solver_scope().stats().moves_accepted,
202                            score_calculations = step_scope.phase_scope().solver_scope().stats().score_calculations,
203                            speed = current_speed,
204                            acceptance_rate = format!(
205                                "{:.1}%",
206                                step_scope.phase_scope().solver_scope().stats().acceptance_rate() * 100.0
207                            ),
208                            current_score = %last_step_score,
209                            best_score = %best_score,
210                        );
211                        step_scope.phase_scope().solver_scope().report_progress();
212                        last_progress_time = now;
213                        last_progress_moves = local_moves_evaluated;
214                    }
215                }
216
217                let evaluation_started = Instant::now();
218                if !mov.is_doable(step_scope.score_director()) {
219                    step_scope
220                        .phase_scope_mut()
221                        .record_evaluated_move(evaluation_started.elapsed());
222                    continue;
223                }
224
225                let move_score = {
226                    let mut recording = RecordingDirector::new(step_scope.score_director_mut());
227                    mov.do_move(&mut recording);
228                    let score = recording.calculate_score();
229                    recording.undo_changes();
230                    score
231                };
232
233                step_scope.phase_scope_mut().record_score_calculation();
234
235                let move_signature = if requires_move_signatures {
236                    Some(mov.tabu_signature(step_scope.score_director()))
237                } else {
238                    None
239                };
240
241                let accepted = self.acceptor.is_accepted(
242                    &last_step_score,
243                    &move_score,
244                    move_signature.as_ref(),
245                );
246
247                step_scope
248                    .phase_scope_mut()
249                    .record_evaluated_move(evaluation_started.elapsed());
250                if accepted {
251                    step_scope.phase_scope_mut().record_move_accepted();
252                }
253
254                trace!(
255                    event = "step",
256                    step = step_scope.step_index(),
257                    move_index = candidate_index,
258                    score = %move_score,
259                    accepted = accepted,
260                );
261
262                if accepted {
263                    self.forager.add_move_index(candidate_index, move_score);
264                }
265            }
266
267            if interrupted_step {
268                match settle_search_interrupt(&mut step_scope) {
269                    StepInterrupt::Restart => continue,
270                    StepInterrupt::TerminatePhase => break,
271                }
272            }
273
274            // Pick the best accepted move index
275            let mut accepted_move_signature = None;
276            if let Some((selected_index, selected_score)) = self.forager.pick_move_index() {
277                let selected_move = cursor.take_candidate(selected_index);
278                if requires_move_signatures {
279                    accepted_move_signature =
280                        Some(selected_move.tabu_signature(step_scope.score_director()));
281                }
282                step_scope.apply_committed_move(&selected_move);
283                step_scope.set_step_score(selected_score);
284
285                // Update last step score
286                last_step_score = selected_score;
287
288                // Update best solution if improved
289                step_scope.phase_scope_mut().update_best_solution();
290            }
291            /* else: no accepted moves this step — that's fine, the acceptor
292            history still needs to advance so Late Acceptance / SA / etc.
293            can eventually escape the local optimum.
294            */
295
296            /* Always notify acceptor that step ended. For stateful acceptors
297            (Late Acceptance, Simulated Annealing, Great Deluge, SCHC),
298            the history must advance every step — even steps where no move
299            was accepted — otherwise the acceptor state stalls.
300            */
301            self.acceptor
302                .step_ended(&last_step_score, accepted_move_signature.as_ref());
303
304            step_scope.complete();
305        }
306
307        // Notify acceptor of phase end
308        self.acceptor.phase_ended();
309
310        let duration = start_time.elapsed();
311        let steps = phase_scope.step_count();
312        let stats = phase_scope.stats();
313        let speed = whole_units_per_second(stats.moves_evaluated, duration);
314        let acceptance_rate = stats.acceptance_rate() * 100.0;
315        let calc_speed = whole_units_per_second(stats.score_calculations, duration);
316
317        let best_score_str = phase_scope
318            .solver_scope()
319            .best_score()
320            .map(|s| format!("{}", s))
321            .unwrap_or_else(|| "none".to_string());
322
323        info!(
324            event = "phase_end",
325            phase = "Local Search",
326            phase_index = phase_index,
327            duration = %format_duration(duration),
328            steps = steps,
329            moves_generated = stats.moves_generated,
330            moves_evaluated = stats.moves_evaluated,
331            moves_accepted = stats.moves_accepted,
332            score_calculations = stats.score_calculations,
333            generation_time = %format_duration(stats.generation_time()),
334            evaluation_time = %format_duration(stats.evaluation_time()),
335            moves_speed = speed,
336            calc_speed = calc_speed,
337            acceptance_rate = format!("{:.1}%", acceptance_rate),
338            score = best_score_str,
339        );
340    }
341
342    fn phase_type_name(&self) -> &'static str {
343        "LocalSearch"
344    }
345}
346
347#[cfg(test)]
348mod tests;