Uboreshaji wa Kundi la Nyuki Bandia (ABC)
Uboreshaji wa Kundi la Nyuki Bandia (ABC) ni metaheuristic ya akili ya kundi inayotegemea kundi, iliyoanzishwa na Karaboga na Basturk mwaka 2007. Inaiga tabia ya ushirikiano wa kutafuta chakula ya kundi la nyuki ili kutafuta suluhisho bora katika matatizo ya uboreshaji wa nambari zinazoendelea. Algorithm hugawanya suluhisho zinazowezekana kati ya aina tatu za nyuki — walioajiriwa, mwangalizi, na mpelelezi — na huziboresha mara kwa mara kupitia utafutaji wa ndani na uteuzi wa uwezekano, na kuifanya ifae kwa watafiti na wahandisi wanaoshughulikia mazingira magumu ya uboreshaji yenye mambo mengi.
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
- Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization, 39(3), 459–471. DOI: 10.1007/s10898-007-9149-x ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). Artificial Bee Colony (ABC) Optimization. ScholarGate. https://scholargate.app/sw/optimization/artificial-bee-colony
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
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →