NSGA-II — Non-dominated Sorting Genetic Algorithm II
NSGA-II (Non-dominated Sorting Genetic Algorithm II) er standardreferencealgoritmen for multi-objektiv evolutionær optimering, introduceret af Deb, Pratap, Agarwal og Meyarivan i 2002. I stedet for at kollapse flere modstridende mål til en enkelt score, udvikler den en population af kandidatløsninger over generationer og returnerer et sæt Pareto-optimale afvejningsløsninger — Pareto-fronten — ved hjælp af hurtig ikke-dominerende sortering og en metrik for 'crowding distance' for at bevare diversitet.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- 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 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 1). Non-dominated Sorting Genetic Algorithm II. ScholarGate. https://scholargate.app/da/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.
- MyrekolonioptimeringOptimering↔ compare
- Differential EvolutionOptimering↔ compare
- Genetisk AlgoritmeOptimering↔ compare
- Partikelsværmoptimering (PSO)Optimering↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →