NSGA-II — Algoriti ya Kinasaba ya Kupanga Isiyotawaliwa II
NSGA-II (Algoriti ya Kinasaba ya Kupanga Isiyotawaliwa II) ni algoriti ya kawaida ya marejeleo kwa ajili ya uboreshaji wa mageuzi yenye malengo mengi, iliyoanzishwa na Deb, Pratap, Agarwal na Meyarivan mwaka 2002. Badala ya kuunganisha malengo mengi yanayokinzana kuwa alama moja, inakuza idadi ya suluhisho zinazowezekana katika vizazi na kurejesha seti ya suluhisho za maelewano bora za Pareto — mpaka wa Pareto — kwa kutumia upangaji wa haraka usiotawaliwa na kipimo cha umbali wa msongamano ili kuhifadhi utofauti.
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
- Deb, K., Pratap, A., Agarwal, S. & Meyarivan, T. (2002). A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182-197. DOI: 10.1109/4235.996017 ↗
- Zitzler, E., Deb, K. & Thiele, L. (2000). Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2), 173-195. DOI: 10.1162/106365600568202 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 1). Non-dominated Sorting Genetic Algorithm II. ScholarGate. https://scholargate.app/sw/optimization/nsga2
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
- Algorithimu ya KijenetikiUboreshaji↔ compare
- Uboreshaji wa Kundi la Chembe (PSO)Uboreshaji↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →