Corpus ID: 4798879

Multiobjectivization with NSGA-II on the Noiseless BBOB Testbed

  title={Multiobjectivization with NSGA-II on the Noiseless BBOB Testbed},
  author={Hussein A. Abbass and J{\"u}rgen Branke and S. Agarwal and T. Meyarivan},
The idea of multiobjectivization is to reformulate a singleobjective 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… Expand

Figures and Tables from this paper

GACE: A meta-heuristic based in the hybridization of Genetic Algorithms and Cross Entropy methods for continuous optimization
A hybrid metaheuristic that combines a Genetic Algorithm with a Cross Entropy method to solve continuous optimization functions and shows that GACE is the best performing method for instances with high dimensionality. Expand
On multiobjective selection for multimodal optimization
This work investigates multiobjective selection methods that identify good quality and diverse solutions from a larger set of candidates and experimentally detects the best selection operators and indicators in two different contexts, namely a one-time subset selection and an iterative application in optimization. Expand


A fast and elitist multiobjective genetic algorithm: NSGA-II
This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently. Expand
Multiobjectivization by Decomposition of Scalar Cost Functions
It is found that decomposition has only one possible effect: to introduce plateaus of incomparable solutions in the fitness landscape of a given problem and affects search. Expand
Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems
In this work, a new model based on the usage of hyperheuristics to facilitate the application of multiobjectivisation with parameters has been proposed and experimental evaluation has shown that this model has increased the robustness of the whole optimisation scheme. Expand
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
This paper uses an abstract building-block problem to illustrate how 'multi-objectivizing' a single-objective optimization (SOO) problem can remove local optima, and investigates small instances of the travelling salesman problem where additional objectives are defined using arbitrary sub-tours. Expand
Multiobjective optimization for dynamic environments
This paper investigates the use of evolutionary multi-objective optimization methods (EMOs) for solving single-objectives optimization problems in dynamic environments and adopts the non-dominated sorting genetic algorithm version 2 (NSGA2). Expand
Analysing the robustness of multiobjectivisation parameters with large scale optimisation problems
The main contribution of this work is to deeply analyse the robustness of multiobjectivisation approaches with parameters to allow designing methods which profit from multiObjectivisation with parameters, without incorporating additional parameters to the whole optimisation scheme. Expand
Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions
The testbed of noise-free functions is defined and motivated, and the participants' favorite black-box real-parameter optimizer in a few dimensions a few hundreds of times and execute the provided post-processing script afterwards. Expand
Real-Parameter Black-Box Optimization Benchmarking: Experimental Setup
Quantifying and comparing performance of numerical optimization algorithms is an important aspect of research in search and optimization. However, this task turns out to be tedious and difficult toExpand
Maximizing population diversity in single-objective optimization
NoAH is proposed, an evolutionary algorithm which solves a mixed multi-objective problem by iteratively switching between objective value and set-diversity optimization while automatically adapting a constraint on the objective value until it reaches the barrier. Expand
Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
  • M. Jensen
  • Computer Science
  • J. Math. Model. Algorithms
  • 2004
Experiments demonstrate that the use of helper-objectives (additional objectives guiding the search) significantly improves the average performance of a standard GA and shows that controlling the proportion of non-dominated solutions in the population is very important when using helper-Objectives. Expand