• Citer

Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms

par Brockhoff, Dimo;López-Ibáñez, Manuel ;Naujoks, Boris;Rudolph, Günther
Référence Lecture Notes in Computer Science, 7491, page (123-132)
Publication Publié, 2012

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

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. © 2012 Springer-Verlag.