Porównaj metody

	NSGA-II	Ewolucja Różnicowa
Dziedzina	Optymalizacja	Optymalizacja
Rodzina	Process / pipeline	Process / pipeline
Rok powstania	2002	1997
Twórca	—	Rainer Storn & Kenneth Price
Typ	Evolutionary multi-objective optimisation algorithm	Population-based stochastic metaheuristic
Źródło pierwotne	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.	Storn, R. & Price, K. (1997). Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11(4), 341–359.
Inne nazwy	NSGA2, Non-dominated Sorting GA II, NSGA-II — Çok Amaçlı Evrimsel Optimizasyon	DE algorithm, Diferansiyel Evrim (DE), DE optimization
Pokrewne	4	5
Podsumowanie	NSGA-II (Non-dominated Sorting Genetic Algorithm II) is the standard reference algorithm for multi-objective evolutionary optimisation, introduced by Deb, Pratap, Agarwal and Meyarivan in 2002. Rather than collapsing multiple conflicting objectives into a single score, it evolves a population of candidate solutions across generations and returns a set of Pareto-optimal trade-off solutions — the Pareto front — using fast non-dominated sorting and a crowding distance metric to preserve diversity.	Differential Evolution (DE), introduced by Rainer Storn and Kenneth Price in 1997, is a population-based stochastic optimisation algorithm designed for continuous parameter spaces. It generates candidate solutions by combining vector differences between existing population members, making it a powerful and parameter-lean alternative to Genetic Algorithms and Particle Swarm Optimisation when the search landscape is non-convex, multimodal, or poorly suited to gradient-based methods.