On Using Populations of Sets in Multiobjective Optimization

Johannes Bader 1 Dimo Brockhoff 2 Samuel Welten 1 Eckart Zitzler 1
2 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

Contributor : Dimo Brockhoff <>
Submitted on : Friday, November 12, 2010 - 7:02:53 PM
Last modification on : Tuesday, March 5, 2019 - 9:32:52 AM
Long-term archiving on : Sunday, February 13, 2011 - 2:51:38 AM


Files produced by the author(s)


  • HAL Id : inria-00535807, version 1



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⟩



Record views


Files downloads