rapid_solve::heuristics

Module local_search

Source
Expand description

This module contains the LocalSearchSolver implementing the local search heuristic. There are several local_improvers (neighborhood exploration stategies) to choose from.

  • Starts with an initial solution and iteratively improves it by exploring the neighborhood of the current solution.
  • The search stops after a certain number of iterations, after a certain time limit, or if no improvement is found in the neighborhood (local minimum is reached).
  • The last solution (which is the best found) is returned.

For examples, see the basic local search solver and the take first local search solver for the TSP.

Modules§

Structs§