Process / pipelineSimulation / optimization

Stochastic Tabu Search — Randomized Metaheuristic with Memory

Stochastic Tabu Search (STS) is an extension of classical Tabu Search that introduces randomness into the neighborhood exploration and move-selection phases. By combining tabu memory — which forbids recently visited solutions — with probabilistic acceptance or random candidate sampling, STS escapes local optima more effectively and explores rugged solution landscapes that deterministic TS may fail to traverse.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI: 10.1287/inte.20.4.74
  2. Hu, J., Fu, M. C., & Marcus, S. I. (2007). A model reference adaptive search method for global optimization. Operations Research, 55(3), 549-568. DOI: 10.1287/opre.1060.0365

Related methods

Referenced by

ScholarGateStochastic Tabu Search (Stochastic Tabu Search — Randomized metaheuristic optimization with tabu memory). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/stochastic-tabu-search