Runtime analysis of simple interactive evolutionary biobjective optimization algorithms

Authors:
Dimo Brockhoff;Manuel López-Ibáñez;Boris Naujoks;Günter Rudolph
Affiliations:
INRIA Lille - Nord Europe, DOLPHIN Team, Villeneuve d'Ascq, France;IRIDIA, Université Libre de Bruxelles (ULB), Brussels, Belgium;Institute for Informatics, Cologne University of Applied Sciences, Gummersbach, Germany;Fakultät für Informatik, Technische Universität Dortmund, Dortmund, Germany
Venue:
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Year:
2012

Citing 3
Cited 0

On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.