Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms

(1) , (2) , (3) , (4)
1
2
3
4

Abstract

Development and deployment of interactive evolutionary multiobjective optimization algorithms (EMOAs) have recently gained broad interest. In this study, first steps towards a theory of interactive EMOAs are made by deriving bounds on the expected number of function evaluations and queries to a decision maker. We analyze randomized local search and the (1+1)-EA on the biobjective problems LOTZ and COCZ under the scenario that the decision maker interacts with these algorithms by providing a subjective preference whenever solutions are incomparable. It is assumed that this decision is based on the decision maker's internal utility function. We show that the performance of the interactive EMOAs may dramatically worsen if the utility function is non-linear instead of linear.
Fichier principal
Vignette du fichier
iEA_authorVersion.pdf (121.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00746132 , version 1 (27-10-2012)
hal-00746132 , version 2 (15-03-2013)

Identifiers

Cite

Dimo Brockhoff, Manuel López-Ibáñez, Boris Naujoks, Günter Rudolph. Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms. Parallel Problem Solving from Nature (PPSN'2012), Sep 2012, Taormina, Italy. pp.123-132, ⟨10.1007/978-3-642-32937-1_13⟩. ⟨hal-00746132v2⟩
293 View
386 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More