Utafutaji wa Tabu wa Kistochastiki — Njia ya Metaheuristic yenye Kumbukumbu
Utafutaji wa Tabu wa Kistochastiki (STS) ni upanuzi wa Utafutaji wa Tabu wa kawaida ambao huleta nasibu katika uchunguzi wa ujirani na awamu za uteuzi wa hatua. Kwa kuchanganya kumbukumbu ya tabu — ambayo inakataza suluhisho zilizotembelewa hivi karibuni — na kukubali kwa uwezekano au sampuli ya wagombea wa nasibu, STS hukimbia optima za ndani kwa ufanisi zaidi na huchunguza mandhari ya suluhisho mbaya ambazo TS ya maamuzi inaweza kushindwa kuvuka.
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. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI: 10.1287/inte.20.4.74 ↗
- Hu, J., Fu, M. C., & Marcus, S. I. (2007). A model reference adaptive search method for global optimization. Operations Research, 55(3), 549-568. DOI: 10.1287/opre.1060.0367 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Stochastic Tabu Search — Randomized metaheuristic optimization with tabu memory. ScholarGate. https://scholargate.app/sw/simulation/stochastic-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.
- Algorithimu ya KijenetikiUboreshaji↔ compare
- Uboreshaji wa Kundi la Chembe (PSO)Uboreshaji↔ compare
- Simulated AnnealingUboreshaji↔ compare
- Algorithmu ya Kijenetiki ya KistokastikiUigaji↔ compare
- Utafutaji TabuUboreshaji↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →