Module local_search

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

local_improver

This module contains several LocalImprover implementations, which define the strategy to explore the neighborhood of a solution in each iteration of the LocalSearchSolver.

Structs

LocalSearchSolver

A local search solver that uses a Neighborhood and an Objective to find a local minimum.