Comparar métodos

	NSGA-II Robusto	Algoritmo Genético Robusto
Área	Simulação	Simulação
Família	Process / pipeline	Process / pipeline
Ano de origem	2006	2005 (systematic survey); earlier applications from late 1990s
Autor original	Kalyanmoy Deb and Himanshu Gupta	Jin, Y. and Branke, J. (systematic formalization); roots in Holland (1975)
Tipo	Robust evolutionary multi-objective optimization algorithm	Metaheuristic evolutionary optimizer with robustness mechanism
Fonte seminal	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.	Jin, Y., Branke, J. (2005). Evolutionary optimization in uncertain environments — a survey. IEEE Transactions on Evolutionary Computation, 9(3), 303–317.
Outros nomes	Robust NSGA2, NSGA-II under uncertainty, Uncertainty-aware NSGA-II, RNSGA-II	RGA, Robust GA, Uncertainty-Aware Genetic Algorithm, Noise-Tolerant Genetic Algorithm
Relacionados	5	6
Resumo	Robust NSGA-II extends the classic NSGA-II evolutionary algorithm to account for parametric uncertainty, finding Pareto-optimal trade-off solutions that remain high-performing even when input parameters deviate from their nominal values. Instead of optimizing objective values at a single point, it evaluates each candidate solution across a range or distribution of uncertainty realizations and selects for robustness alongside Pareto dominance.	The Robust Genetic Algorithm (RGA) extends standard genetic algorithms to find solutions that perform well not only at the nominal design point but also when subjected to uncertainty in decision variables, parameters, or fitness evaluations. By incorporating explicit robustness measures into selection pressure, RGA balances optimality against sensitivity to perturbation, making it suitable for engineering design, scheduling, and policy optimization under real-world variability.