TabuSearchOptions<T, TInput, TOutput>

Options & Configuration · AiDotNet.Models.Options

Configuration options for Tabu Search, a metaheuristic optimization algorithm that enhances local search by using memory structures to avoid revisiting previously explored solutions.

Inheritance: ModelOptions → OptimizationAlgorithmOptions<T, TInput, TOutput> → GeneticAlgorithmOptimizerOptions<T, TInput, TOutput> → TabuSearchOptions<T, TInput, TOutput>

For Beginners

Tabu Search is like exploring a maze while keeping a list of recently visited paths to avoid.

When solving optimization problems:

  • Simple local search methods often get stuck in “local optima” (solutions that are better than their neighbors but not the best overall)
  • They can also waste time revisiting the same solutions repeatedly

Tabu Search solves this by:

  • Keeping a “tabu list” of recently visited solutions that are temporarily forbidden
  • Forcing the search to explore new areas even if they initially seem worse
  • Adaptively adjusting its parameters based on search progress
  • Combining elements of memory, neighborhood exploration, and strategic oscillation

This approach offers several benefits:

  • Effectively escapes local optima
  • Avoids cycling through the same solutions
  • Efficiently explores the solution space
  • Works well for complex combinatorial problems

This class lets you configure how the Tabu Search algorithm behaves.

How It Works

Tabu Search is an iterative neighborhood search algorithm that enhances local search by avoiding points in the search space that have already been visited. The main feature of Tabu Search is the use of explicit memory (the tabu list) with two goals: to prevent the search from revisiting previously visited solutions, and to explore unvisited areas of the solution space. This approach helps escape local optima and avoid cycling in the search process. Tabu Search is particularly effective for combinatorial optimization problems where the search space is discrete and contains many local optima. This class inherits from GeneticAlgorithmOptimizerOptions and adds parameters specific to Tabu Search, such as tabu list size, neighborhood size, and various adaptive parameters for controlling the search process.

Constructors

Constructor Summary
TabuSearchOptions() Initializes a new instance with the TabuSearch defaults.
TabuSearchOptions(TabuSearchOptions<T, TInput, TOutput> other) Initializes a new instance as a copy of other, with every setting copied.

Properties

Property Summary
double InitialMutationRate { get; set; } Gets or sets the initial mutation rate.
double MaxFeatureRatio { get; set; } Gets or sets the maximum ratio of features to consider in the search.
double MinFeatureRatio { get; set; } Gets or sets the minimum ratio of features to consider in the search.
double NeighborhoodSizeDecay { get; set; } Gets or sets the decay factor for the neighborhood size.
double NeighborhoodSizeIncrease { get; set; } Gets or sets the increase factor for the neighborhood size.
double PerturbationFactor { get; set; } Gets or sets the factor for perturbing solutions to generate neighbors.
double TabuListSizeDecay { get; set; } Gets or sets the decay factor for the tabu list size.
double TabuListSizeIncrease { get; set; } Gets or sets the increase factor for the tabu list size.
int InitialNeighborhoodSize { get; set; } Gets or sets the initial size of the neighborhood.
int InitialTabuListSize { get; set; } Gets or sets the initial size of the tabu list.
int MaxNeighborhoodSize { get; set; } Gets or sets the maximum size of the neighborhood.
int MaxTabuListSize { get; set; } Gets or sets the maximum size of the tabu list.
int MinNeighborhoodSize { get; set; } Gets or sets the minimum size of the neighborhood.
int MinTabuListSize { get; set; } Gets or sets the minimum size of the tabu list.
int NeighborhoodSize { get; set; } Gets or sets the size of the neighborhood to explore in each iteration.
int TabuListSize { get; set; } Gets or sets the size of the tabu list.