An Efficient Non-dominated Sorting Method for Evolutionary Algorithms

@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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Scalable multi-objective optimization test problems

  • K. Deb, L. Thiele, M. Laumanns, E. Zitzler
  • Proceedings of IEEE Congress on Evolutionary…
  • 2002
Highly Influential
20 Excerpts

Design and Analysis of Experiments

  • D. C. Montgomery
  • 2001
Highly Influential
3 Excerpts

A fast and elitist multi-objective genetic algorithm: NSGA-II

  • K. Deb, A. Pratab, S. Agarwal, T. Meyarivan
  • IEEE Transactions on Evolutionary Computation,
  • 2002
Highly Influential
20 Excerpts

Available at http://www.daimi.au.dk/ mjensen/research/nsgaiidownload. tar.gz

  • M. T. Jensen
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…