NSGA-III
NSGA-III (Non-dominated Sorting Genetic Algorithm III), iliyotengenezwa na Kalyanmoy Deb na Himanshu Jain mwaka 2014, ni algoriti ya kisasa ya mageuzi kwa matatizo ya uboreshaji wa malengo mengi. Inaongeza algoriti maarufu ya NSGA-II kwa uteuzi unaozingatia pointi za marejeo, kuwezesha kushughulikia kwa ufanisi matatizo yenye malengo matatu au zaidi yanayokinzana.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Ramani ya mbinu
Jirani ya mbinu zinazohusiana — chagua nodi ili kuchunguza.
Vyanzo
- Deb, K., & Jain, H. (2014). An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation, 18(4), 577-601. DOI: 10.1109/TEVC.2013.2281534 ↗
- Deb, K., Agrawal, S., Pratap, A., & 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 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Non-dominated Sorting Genetic Algorithm III. ScholarGate. https://scholargate.app/sw/operations-research/nsga-iii
Mbinu ipi?
Weka mbinu hii kando ya jamaa zake wa karibu na uzisome bega kwa bega — maktaba huweka vitabu mezani; uamuzi ni wako.
- Uboreshaji wa Malengo MengiUigaji↔ linganisha
- Uboreshaji wa Kundi la Chembe (PSO)Uboreshaji↔ linganisha
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →