Posts Tagged ‘Nondominated Sorting Genetic Algorithm’


February 21, 2019

Since October 2017, I have been involving as a member of International Joint Research (IJR) project between 3 institutions (2 France, 1 Indonesian). Currently I’m an associate professor at UMB (maybe until [month] 20[xx] 🙂 ) and a PostDoc fellow at CESI Starsbourg, France, as a part of joint research between UMB-UHA-CESI. We have started our project on December 2017. (more…)

Non-dominated Sorting Genetic Algorithm

November 6, 2018

Non-dominated Sorting Genetic Algorithm, Nondominated Sorting Genetic Algorithm, Fast Elitist Non-dominated Sorting Genetic Algorithm, NSGA, NSGA-II


The Non-dominated Sorting Genetic Algorithm is a Multiple Objective Optimization (MOO) algorithm and is an instance of an Evolutionary Algorithm from the field of Evolutionary Computation. Refer to for more information and references on Multiple Objective Optimization. NSGA is an extension of the Genetic Algorithm for multiple objective function optimization. It is related to other Evolutionary Multiple Objective Optimization Algorithms (EMOO) (or Multiple Objective Evolutionary Algorithms MOEA) such as the Vector-Evaluated Genetic Algorithm (VEGA), Strength Pareto Evolutionary Algorithm (SPEA), and Pareto Archived Evolution Strategy (PAES). There are two versions of the algorithm, the classical NSGA and the updated and currently canonical form NSGA-II.