A fast and elitist multiobjective genetic algorithm: NSGA-II

@article{Deb2002AFA,
  title={A fast and elitist multiobjective genetic algorithm: NSGA-II},
  author={K. Deb and Samir Agrawal and Amrit Pratap and T. Meyarivan},
  journal={IEEE Trans. Evol. Comput.},
  year={2002},
  volume={6},
  pages={182-197}
}
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… Expand
NON-DOMINATED RANKED GENETIC ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS: NRGA
TLDR
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. Expand
A Multi-objective Genetic Algorithm Based on Quick Sort
TLDR
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. Expand
An Improved Nondominated Sorting Multiobjective Genetic Algorithm and Its Applicationf
TLDR
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. Expand
Reducing the run-time complexity of NSGA-II for bi-objective optimization problem
  • Min Liu, Wenhua Zeng
  • Mathematics
  • 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems
  • 2010
NSGA-II is a multi-objective evolutionary algorithm, and its performance is so good that it has become very popular in the last few years. To improve the efficiency of NSGA-II for bi-objectiveExpand
An Improved Selection Operator for Multi-objective Optimization
TLDR
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. Expand
Modified non-dominated sorting genetic algorithm III with fine final level selection
TLDR
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. Expand
A New Decomposition-Based NSGA-II for Many-Objective Optimization
TLDR
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. Expand
Merge Non-Dominated Sorting Algorithm for Many-Objective Optimization
TLDR
The results indicate that the MNDS algorithm outperforms the other techniques in terms of the number of comparisons as well as the total running time, and is compared against six well-known techniques that can be considered as the state-of-the-art. Expand
Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence
TLDR
By applying an elitist multi-objective EA (NSGA-II) to a number of difficult test problems, it is shown that the NS GA-II with controlled elitism has much better convergence property than the original NSGA- II. Expand
Multi-objective evolutionary algorithms based on the summation of normalized objectives and diversified selection
TLDR
With the proposed method, the performance metric has improved significantly and the speed of the parent selection process has also increased when compared with the non-domination sorting, and the proposed algorithm also outperforms ten other algorithms. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
TLDR
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. Expand
The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation
  • Joshua D. Knowles, D. Corne
  • Mathematics, Computer Science
  • Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
  • 1999
TLDR
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. Expand
An evolutionary algorithm for multiobjective optimization: the strength Pareto approach
TLDR
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. Expand
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
TLDR
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. Expand
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
TLDR
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. Expand
A niched Pareto genetic algorithm for multiobjective optimization
TLDR
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. Expand
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example
TLDR
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. Expand
Evolutionary algorithms for multiobjective optimization: methods and applications
TLDR
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. Expand
An Efficient Constraint Handling Method for Genetic Algorithms
Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimizationExpand
Understanding Interactions among Genetic Algorithm Parameters
TLDR
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. Expand
...
1
2
3
4
5
...