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.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI: 10.1287/ijoc.1.3.190 ↗
- 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.
- Algorithmu ya Kijeni ya Kulingana na AjanetiUigaji↔ compare
- Uundaji wa Ruwaza za Mawakala (ABM)Uigaji↔ compare
- Utafutaji wa Tabu Wenye Malengo Mengi (MOTS)Uigaji↔ compare
- Utafutaji TabuUboreshaji↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →