Multiobjectivization with NSGA-ii on the noiseless BBOB testbed

The idea of multiobjectivization is to reformulate a single-objective problem as a multiobjective one. In one of the scarce studies proposing this idea for problems in continuous domains, the distance to the closest neighbor (DCN) in the population of a multiobjective algorithm has been used as the additional (dynamic) second objective. As no comparison with other state-of-the-art single-objective optimizers has been presented for this idea, we have benchmarked two variants (with and without the second DCN objective) of the original NSGA-II algorithm using two different mutation operators on the noiseless BBOB'2013 testbed. It turns out that multiobjectivization helps for several of the 24 benchmark functions, but that, compared to the best algorithms from BBOB'2009, a significant performance loss is visible. Moreover, on some functions, the choice of the mutation operator has a stronger impact on the performance than whether multiobjectivization is employed or not.

[1]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[2]  Hussein A. Abbass,et al.  Searching under Multi-evolutionary Pressures , 2003, EMO.

[3]  Lothar Thiele,et al.  Maximizing population diversity in single-objective optimization , 2011, GECCO '11.

[4]  K. Price.  Differential evolution vs. the functions of the 2/sup nd/ ICEO , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5]  Lothar Thiele,et al.  Multiobjective genetic programming: reducing bloat using SPEA2 , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[6]  Hussein A. Abbass,et al.  Multiobjective optimization for dynamic environments , 2005, 2005 IEEE Congress on Evolutionary Computation.

[7]  Joshua D. Knowles,et al.  Multiobjectivization by Decomposition of Scalar Cost Functions , 2008, PPSN.

[8]  Anne Auger,et al.  Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[9]  Eduardo Segredo,et al.  Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems , 2013, EVOLVE.

[10]  Mikkel T. Jensen,et al.  Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation , 2004, J. Math. Model. Algorithms.

[11]  N. Hansen,et al.  Real-Parameter Black-Box Optimization Benchmarking: Experimental Setup , 2010 .

[12]  Joshua D. Knowles,et al.  Investigations into the Effect of Multiobjectivization in Protein Structure Prediction , 2008, PPSN.

[13]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[14]  Frank Neumann,et al.  On the Effects of Adding Objectives to Plateau Functions , 2009, IEEE Transactions on Evolutionary Computation.

[15]  Eduardo Segredo,et al.  Analysing the robustness of multiobjectivisation parameters with large scale optimisation problems , 2012, 2012 IEEE Congress on Evolutionary Computation.

[16]  Edwin D. de Jong,et al.  Reducing bloat and promoting diversity using multi-objective methods , 2001 .