## Nondominated sorting based on sum of objectives

- Vikas Palakonda, Trinadh Pamulapati, Rammohan Mallipeddi, Partha P. Biswas, Kalyana Chakravarthy Veluvolu
- 2017 IEEE Symposium Series on Computational…
- 2017

Highly Influenced

@article{Fang2008AnEN, title={An Efficient Non-dominated Sorting Method for Evolutionary Algorithms}, author={Hongbing Fang and Qian Wang and Yi-Cheng Tu and Mark F. Horstemeyer}, journal={Evolutionary Computation}, year={2008}, volume={16}, pages={355-384} }

- Published 2008 in Evolutionary Computation
DOI:10.1162/evco.2008.16.3.355

We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN2) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-dominated fronts takes the majority of total computational time (excluding the cost of fitness… CONTINUE READING