Skip to main navigation Skip to search Skip to main content

On using populations of sets in multiobjective optimization

  • ETH Zurich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationEvolutionary Multi-Criterion Optimization - 5th International Conference, EMO 2009, Proceedings
Pages140-154
Number of pages15
DOIs
Publication statusPublished - 1 Dec 2010
Externally publishedYes
Event5th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2009 - Nantes, France
Duration: 7 Apr 200910 Apr 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5467 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2009
Country/TerritoryFrance
CityNantes
Period7/04/0910/04/09

Fingerprint

Dive into the research topics of 'On using populations of sets in multiobjective optimization'. Together they form a unique fingerprint.

Cite this