Process / pipelineSimulation / optimization

Robust NSGA-II — Multi-objective Optimization under Uncertainty

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. 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
  2. Deb, K., & Gupta, H. (2006). Introducing robustness in multi-objective optimization. Evolutionary Computation, 14(4), 463-494. DOI: 10.1162/evco.2006.14.4.463

Related methods

Referenced by

ScholarGateRobust NSGA-II (Robust Non-dominated Sorting Genetic Algorithm II). Retrieved 2026-06-04 from https://scholargate.app/en/simulation/robust-nsga-ii