Félix-Antoine Fortin
ABSTRACT
This paper improves upon the reference NSGA-II procedure by removing an instability in its crowding distance operator. This instability stems from the cases where two or more individuals on a Pareto front share identical fitnesses. In those cases, the instability causes their crowding distance to either become null, or to depend on the individual's position within the Pareto front sequence. Experiments conducted on nine different benchmark problems show that, by computing the crowding distance on unique fitnesses instead of individuals, both the convergence and diversity of NSGA-II can be significantly improved.
- 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.Google Scholar
- 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. Google ScholarDigital Library
- K. Deb and R. Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9:1--34, 1994.Google Scholar
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Knowles and D. Corne. Approximating the nondominated front using the pareto archived evolution strategy. Evolutionary computation, 8(2):149--172, 2000. Google ScholarDigital Library
- K. Price. Differential evolution vs. the functions of the 2nd iceo. In Evolutionary Computation, 1997., IEEE International Conference on, pages 153--157, Apr. 1997.Google Scholar
- K. Sindhya, K. Miettinen, and K. Deb. A hybrid framework for evolutionary multi-objective optimization. IEEE Transactions on Evolutionary Computation, 2012. in press.Google Scholar
- N. Srinivas and K. Deb. Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation, 2(3):221--248, 1994. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2):173--195, 2000. Google ScholarDigital Library
- 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.Google Scholar
Index Terms
- Revisiting the NSGA-II crowding-distance computation
Recommendations
Better approximation guarantees for the NSGA-II by using the current crowding distance
GECCO '22: Proceedings of the Genetic and Evolutionary Computation ConferenceA recent runtime analysis (Zheng, Liu, Doerr (2022)) has shown that a variant of the NSGA-II algorithm can efficiently compute the full Pareto front of the OneMinMax problem when the population size is by a constant factor larger than the Pareto front, ...
Evolutionary many-objective optimization by NSGA-II and MOEA/D with large populations
SMC'09: Proceedings of the 2009 IEEE international conference on Systems, Man and CyberneticsEvolutionary multiobjective optimization (EMO) is an active research area in the field of evolutionary computation. EMO algorithms are designed to find a non-dominated solution set that approximates the entire Pareto front of a multiobjective ...
Empirical Analysis of Using Weighted Sum Fitness Functions in NSGA-II for Many-Objective 0/1 Knapsack Problems
UKSIM '09: Proceedings of the UKSim 2009: 11th International Conference on Computer Modelling and SimulationHandling of many-objective problems is a hot issue in the evolutionary multiobjective optimization (EMO) community. It is well-known that frequently-used EMO algorithms such as NSGA-II and SPEA do not work well on many-objective problems whereas they ...
Comments