Process / pipelineSimulation / optimization

Robust Tabu Search — Tabu-based metaheuristic with robustness against uncertainty

Robust Tabu Search (RTS) extends the classical Tabu Search metaheuristic by evaluating candidate solutions not only on their nominal objective value but also on their performance under uncertainty. Instead of seeking the best solution for a single scenario, RTS seeks solutions that perform well across a range of scenarios or realizations, trading peak optimality for reliability.

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. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI: 10.1287/ijoc.1.3.190
  2. Dolan, E. D., Lewis, R. M., & Torczon, V. (2003). On the local convergence of pattern search. SIAM Journal on Optimization, 14(2), 567–583. link

Related methods

Referenced by

ScholarGateRobust Tabu Search (Robust Tabu Search — Tabu-based metaheuristic with robustness against uncertainty). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/robust-tabu-search