On Using Populations of Sets in Multiobjective Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

On Using Populations of Sets in Multiobjective Optimization

Abstract

Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal set. That means they are solving a set problem where the search space consists of all possible solution sets. Taking this perspective, multiobjective evolutionary algorithms can be regarded as hill-climbers on solution sets: the population is one element of the set search space and selection as well as variation implement a specific type of set mutation operator. Therefore, one may ask whether a ‘real' evolutionary algorithm on solution sets can have advantages over the classical single-population approach. This paper investigates this issue; it presents a multi-population multiobjective optimization framework and demonstrates its usefulness on several test problems and a sensor network application.
Fichier principal
Vignette du fichier
EMO2009authorVersion.pdf (551.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00535807 , version 1 (12-11-2010)

Identifiers

  • HAL Id : inria-00535807 , version 1

Cite

Johannes Bader, Dimo Brockhoff, Samuel Welten, Eckart Zitzler. On Using Populations of Sets in Multiobjective Optimization. Evolutionary Multi-Criterion Optimization (EMO 2009), Apr 2009, Nantes, France. pp.140-154. ⟨inria-00535807⟩
206 View
169 Download

Share

Gmail Facebook X LinkedIn More