ScholarGate
Msaidizi
Process / pipelineSimulation / optimization

Utafutaji wa Tabu unaoendeshwa na Ajenti — Uboreshaji wa Metaheuristic wa Mawakala Wengi Waliogawanywa

Utafutaji wa Tabu unaoendeshwa na Ajenti (ABTS) huunganisha metaheuristic ya utafutaji wa tabu ndani ya mfumo wa mawakala wengi ambapo mawakala huru kila mmoja huendesha nyuzi za utafutaji wa tabu zinazojitegemea au zinazoshirikiana, wakishiriki suluhisho zenye matumaini ili kutoroka kutoka kwa viwango vya juu vya ndani na kuchunguza kwa pamoja nafasi kubwa za utafutaji za mchanganyiko au zinazoendelea kwa ufanisi zaidi kuliko utekelezaji wa nyuzi moja.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

Vyanzo

  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/bf02430365

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 3). Agent-Based Tabu Search — Distributed Multi-Agent Metaheuristic Optimization. ScholarGate. https://scholargate.app/sw/simulation/agent-based-tabu-search

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side
ScholarGateAgent-based Tabu Search (Agent-Based Tabu Search — Distributed Multi-Agent Metaheuristic Optimization). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/simulation/agent-based-tabu-search · Seti ya data: https://doi.org/10.5281/zenodo.20539026