Utafutaji Tabu — Metaheuristiki ya Utafutaji wa Kienyeji
Utafutaji Tabu ni metaheuristiki ya utafutaji wa kienyeji iliyoanzishwa na Fred Glover mnamo 1989, inayotumia orodha tabu — kumbukumbu ya muda mfupi ya suluhisho zilizotembelewa hivi karibuni — kuzuia mizunguko na kutoroka optima za kienyeji. Kwa kukataza waziwazi hatua zinazobatilisha maamuzi ya hivi karibuni, algoriti huchunguza nafasi ya utafutaji kwa upana zaidi na, kupitia miundo ya kumbukumbu ya muda mrefu kama vile vigezo vya matarajio, inalenga kukaribia optimumu ya kimataifa hata katika matatizo makubwa, changamano ya kiunganishi.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
+5 more
Vyanzo
- Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗
- Glover, F. & Laguna, M. (1997). Tabu Search. Springer. ISBN: 9780792349907
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 1). Tabu Search (Tabu Search Metaheuristic). ScholarGate. https://scholargate.app/sw/optimization/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.
- Ushindani wa Makoloni ya FukoUboreshaji↔ compare
- Algorithimu ya KijenetikiUboreshaji↔ compare
- Uboreshaji wa Kundi la Chembe (PSO)Uboreshaji↔ compare
- Simulated AnnealingUboreshaji↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →