Revisiting the NSGA-II crowding-distance computation

GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference

Volumn , Issue , 2013, Pages 623-630

  Fortin, Félix Antoine ^a   Parizeau, Marc ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

Crowding distance; Multi objective evolutionary algorithms; NSGA II

Indexed keywords

BENCH-MARK PROBLEMS; CROWDING DISTANCE; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; NSGA-II; PARETO FRONT;

EVOLUTIONARY ALGORITHMS;

EID: 84883079141     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463372.2463456     Document Type: Conference Paper

References (16)

1. C. Coello Coello. Recent trends in evolutionary multiobjective optimization. In A. Abraham, L. Jain, and R. Goldberg, editors, Evolutionary Multiobjective Optimization, Advanced Information and Knowledge Processing, pages 7-32. Springer London, 2005.
2. D. Corne, J. Knowles, and M. Oates. The pareto envelope-based selection algorithm for multiobjective optimization. In Parallel Problem Solving from Nature PPSN VI, pages 839-848. Springer, 2000.
3. K. Deb and R. Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9:1-34, 1994.
4. K. Deb and H. Jain. Handling many-objective problems using an improved NSGA-II procedure. In Evolutionary Computation (CEC), 2012 IEEE Congress on, pages 1-8, June 2012.
5. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182-197, Apr. 2002.
6. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable multi-objective optimization test problems. In Congress on Evolutionary Computation (CEC 2002), pages 825-830. IEEE Press, 2002.
7. F.-A. Fortin, F.-M. De Rainville, M.-A. Gardner, M. Parizeau, and C. Gagné. DEAP: Evolutionary algorithms made easy. Journal of Machine Learning Research, 2171-2175(13), Jul. 2012.
8. F.-A. Fortin, S. Grenier, and M. Parizeau. Generalizing the improved run-time complexity algorithm for non-dominated sorting. In Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), July 2013. to appear.
9. N. Hansen, A. Auger, R. Ros, S. Finck, and P. Posik. Comparing results of 31 algorithms from the black-box optimization benchmarking bbob-2009. In ACM, editor, Workshop Proceedings of the GECCO Genetic and Evolutionary Computation Conference, pages 1689-1696, 2010.
10. J. Knowles and D. Corne. Approximating the nondominated front using the pareto archived evolution strategy. Evolutionary computation, 8(2):149-172, 2000.
11. K. Price. Differential evolution vs. the functions of the 2nd iceo. In Evolutionary Computation, 1997., IEEE International Conference on, pages 153-157, Apr. 1997.
12. K. Sindhya, K. Miettinen, and K. Deb. A hybrid framework for evolutionary multi-objective optimization. IEEE Transactions on Evolutionary Computation, 2012. in press.
13. N. Srinivas and K. Deb. Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation, 2(3):221-248, 1994.
14. A. Zhou, B.-Y. Qu, H. Li, S.-Z. Zhao, P. N. Suganthan, and Q. Zhang. Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Computation, 1(1):32-49, 2011.
15. E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2):173-195, 2000.
16. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the strength Pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001.