Bayesian Tabu Search — Mwongozo wa uwezekano umeunganishwa na utafutaji wa ndani unaotegemea kumbukumbu
Bayesian Tabu Search (BTS) ni metaheuristic ya mseto inayounganisha utaratibu wa marufuku ya hoja unaotegemea kumbukumbu wa Tabu Search ya kawaida na mfumo wa uwezekano wa Bayesian. Sehemu ya Bayesian hujifunza kutoka kwa tathmini za zamani ili kupanga hoja zinazowezekana, ikilenga utafutaji katika maeneo yenye matarajio huku orodha ya marufuku ikizuia kurudiarudia. Mchanganyiko huu hupunguza tathmini za kazi ambazo hazina maana katika matatizo magumu ya upangaji na yanayoendelea.
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 ↗
- Bergstra, J., Bardenet, R., Bengio, Y., Kegl, B. (2011). Algorithms for hyper-parameter optimization. Advances in Neural Information Processing Systems (NIPS), 24, 2546–2554. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Bayesian Tabu Search — Probabilistic guidance integrated with memory-based local search. ScholarGate. https://scholargate.app/sw/simulation/bayesian-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 Kijeni ya KibayesianiUigaji↔ compare
- Utaftaji wa BayesianUboreshaji↔ compare
- Utekelezaji wa Utekelezaji wa BayesianUigaji↔ compare
- Simulated AnnealingUboreshaji↔ compare
- Utafutaji wa Tabu wa KistochastikiUigaji↔ compare
- Utafutaji TabuUboreshaji↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →