A fast and elitist multiobjective genetic algorithm: NSGA ...

← Back to document page

182IEEE TRANSACTIONS ON evolutionary COMPUTATION, VOL. 6, NO. 2, APRIL 2002A Fast and elitist multiobjective genetic algorithm :NSGA-IIKalyanmoy Deb, Associate Member, IEEE, Amrit Pratap, Sameer Agarwal, and T. MeyarivanAbstract multiobjective evolutionary algorithms (EAs)that use nondominated sorting and sharing have been criti-cized mainly for their: 1)(3)computational complexity(whereis the number of objectives andis the populationsize); 2) nonelitism approach; and 3) the need for specifying asharing parameter. In this paper, we suggest a nondominatedsorting-based multiobjective EA (MOEA), called nondominatedsorting genetic algorithm II (NSGA-II), which alleviates allthe above three difficulties. Specifically, a fast nondominatedsorting approach with(2)computational complexity ispresented. Also, a selection operator is presented that creates amating pool by combining the parent and offspring populationsand selecting the best (with respect to fitness and spread)solutions.

182 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2, APRIL 2002 A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II Kalyanmoy Deb, Associate Member, IEEE, Amrit Pratap, Sameer Agarwal, and T. Meyarivan

  Genetic, Algorithm, Evolutionary, Sang, Multiobjective, And elitist multiobjective genetic algorithm, Elitist