Process / pipelineSimulation / optimization

Agent-Based Tabu Search — Distributed Multi-Agent Metaheuristic Optimization

Agent-Based Tabu Search (ABTS) embeds the tabu search metaheuristic inside a multi-agent framework where autonomous agents each run independent or cooperating tabu search threads, sharing promising solutions to escape local optima and collectively explore large combinatorial or continuous search spaces more effectively than a single-thread implementation.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

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. Verhoeven, M. G. A., Aarts, E. H. L. (1995). Parallel local search. Journal of Heuristics, 1(1), 43–65. DOI: 10.1007/BF02430366

Related methods

ScholarGateAgent-based Tabu Search (Agent-Based Tabu Search — Distributed Multi-Agent Metaheuristic Optimization). Retrieved 2026-06-04 from https://scholargate.app/tr/simulation/agent-based-tabu-search