Algorithimu ya Kijenetiki — Uboreshaji kwa njia ya Mageuko
Algorithimu ya kijenetiki (GA) ni mbinu ya hisabati ya juu inayotegemea kundi la suluhisho zinazobadilika, iliyoanzishwa na John Henry Holland (1975) ambayo huiga kanuni za uteuzi wa asili. Huhifadhi kundi la suluhisho zinazowezekana na huziboresha kwa hatua kupitia uteuzi, mseto, na waendeshaji wa mabadiliko, na kuifanya kuwa yenye nguvu hasa katika maeneo ya utafutaji yasiyoendelea, yasiyo ya mbonyeo, na yenye mambo mengi ambapo mbinu za kawaida zinazotegemea mteremko hufeli.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
+23 more
Vyanzo
- Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗
- Deb, K. (2001). Multi-Objective Optimization using Evolutionary Algorithms. Wiley. ISBN: 9780471873396
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 1). Genetic Algorithm — Evolutionary Optimization. ScholarGate. https://scholargate.app/sw/optimization/genetic-algorithm
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
- Differential EvolutionUboreshaji↔ compare
- NSGA-IIUboreshaji↔ compare
- Uboreshaji wa Kundi la Chembe (PSO)Uboreshaji↔ compare
- Simulated AnnealingUboreshaji↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →