Skip to Main content Skip to Navigation
Conference papers

Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Dimo Brockhoff Connect in order to contact the contributor
Submitted on : Friday, March 15, 2013 - 2:20:59 PM
Last modification on : Tuesday, October 19, 2021 - 12:55:32 PM
Long-term archiving on: : Sunday, June 16, 2013 - 6:30:07 AM


Files produced by the author(s)



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⟩



Les métriques sont temporairement indisponibles