A fast and elitist multiobjective genetic algorithm: NSGA-II

  title={A fast and elitist multiobjective genetic algorithm: NSGA-II},
  author={Kalyanmoy Deb and Samir Agrawal and Amrit Pratap and T. Meyarivan},
  journal={IEEE Trans. Evol. Comput.},
Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (where M is the number of objectives and N is the population size); (2) their non-elitism approach; and (3) the need to specify a sharing parameter. In this paper, we suggest a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties… 


A method combining the new Ranked based Roulette Wheel selection algorithm with Pareto-based population ranking Algorithm is proposed, named Non-dominated Ranking Genetic Algorithm (NRGA), which alleviates most of the above three difficulties.

A Multi-objective Genetic Algorithm Based on Quick Sort

It is proved that the individuals of an evolutionary population can be sorted by quick sort, and the time complexity of the construction is O( nlog n), compared to the previous best result of O(n 2) described in the popular NSGA-II.

A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)

It is proved that employing at least many reference points ensures that once a solution for a certain trade-off between the objectives is found, the population contains such a solution in all future iterations, and it is shown that the expected number of iterations until the population covers the Pareto front is in O.

An Improved Nondominated Sorting Multiobjective Genetic Algorithm and Its Applicationf

A new technique for alleviating overlapping solutions in the population and an affection on the spread of nondominated solutions is incorporated to enhance the capability of NSGA-II, the widely used nondominated sorting genetic algorithm with elitism.

Reducing the run-time complexity of NSGA-II for bi-objective optimization problem

  • Min LiuWenhua Zeng
  • Computer Science
    2010 IEEE International Conference on Intelligent Computing and Intelligent Systems
  • 2010
A new bi-objective non- dominated sorting algorithm is proposed to replace the original non-dominated sorting method of NSGA-II, and the time complexity of this algorithm is reduced to O(kN+MogN), where k is the number ofnon-dominated fronts, and k«N.

An Improved Selection Operator for Multi-objective Optimization

Experimental results show that the proposed improved selection operator (ISO) effectively reduces the computational burden and enhance the selection diversity by the aid of S-Rank and S-Rand.

Modified non-dominated sorting genetic algorithm III with fine final level selection

A variation of NSGA-III algorithm based on fine final level selection is proposed to improve convergence and obtains the best performance by comparing 9 state-of-art algorithms in HV, GD indexes and ranks third for IGD indicator.

A New Decomposition-Based NSGA-II for Many-Objective Optimization

The augmented MOEA, labeled as RP-dominance-based NSGA-II, has been statistically demonstrated to provide competitive and oftentimes better results when compared against four recently proposed decomposition-based MOEAs on commonly-used benchmark problems involving up to 20 objectives.

A Novel DOE-Based Selection Operator for NSGA-II Algorithm

A modified variant of Non-dominated Sorting Genetic Algorithm (NSGA-II) is introduced that uses Design of Experiments (DOE) regression model to insert ideal points to the population in each generation and the performance of the proposed algorithm is investigated on five bi-objective benchmark problems.



Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms

Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously are investigated and suggested to be extended to higher dimensional and more difficult multiobjective problems.

The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation

  • Joshua D. KnowlesD. Corne
  • Computer Science
    Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
  • 1999
It is argued that PAES may represent the simplest possible non-trivial algorithm capable of generating diverse solutions in the Pareto optimal set, and is intended as a good baseline approach against which more involved methods may be compared.

An evolutionary algorithm for multiobjective optimization: the strength Pareto approach

A new evolutionary approach to multicriteria optimization the Strength Pareto Evolutionary Algorithm SPEA is proposed which combines various features of previous multiobjective EAs in a unique manner and is characterized as follows.

Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

A rank-based fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs) and the genetic algorithm is seen as the optimizing element of a multiobjective optimization loop, which also comprises the DM.

Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

This paper provides a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions and shows that elitism is shown to be an important factor for improving evolutionary multiobjectives search.

A niched Pareto genetic algorithm for multiobjective optimization

The Niched Pareto GA is introduced as an algorithm for finding the Pare to optimal set and its ability to find and maintain a diverse "Pareto optimal population" on two artificial problems and an open problem in hydrosystems is demonstrated.

Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example

This study illustrates how a technique such as the multiobjective genetic algorithm can be applied and exemplifies how design requirements can be refined as the algorithm runs, and demonstrates the need for preference articulation in cases where many and highly competing objectives lead to a nondominated set too large for a finite population to sample effectively.

Evolutionary algorithms for multiobjective optimization: methods and applications

The basic principles of evolutionary multiobjective optimization are discussed from an algorithm design perspective and the focus is on the major issues such as fitness assignment, diversity preservation, and elitism in general rather than on particular algorithms.

Understanding Interactions among Genetic Algorithm Parameters

This paper investigates the performance of simple tripartite GAs on a number of simple to complex test problems from a practical standpoint and recommends that when in doubt, the use of the crossover operator with an adequate population size is a reliable approach.