Process / pipelineSimulation / optimization

Stochastic NSGA-II — Evolutionary Multi-Objective Optimization under Uncertainty

Stochastic NSGA-II extends the NSGA-II evolutionary algorithm to handle objective functions that are noisy, uncertain, or probabilistic. By averaging or sampling stochastic objectives across multiple evaluations, it identifies Pareto-optimal solutions that are robust to uncertainty, making it suitable for engineering design, supply chain, and policy optimization problems where real-world variability matters.

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. Hughes, E. J. (2001). Evolutionary multi-objective ranking with uncertainty and noise. In Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization (EMO 2001), Lecture Notes in Computer Science, vol. 1993, pp. 329–343. Springer. DOI: 10.1007/3-540-44719-9_23

Related methods

Referenced by

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