 |
|
|||
| Authors: | Eckart Zitzler, Lothar Thiele, Johannes Bader |
| Group: | Computer Engineering |
| Type: | Inproceedings |
| Title: | SPAM: Set Preference Algorithm for Multiobjective Optimization |
| Year: | 2008 |
| Month: | September |
| Pub-Key: | ztb2008b |
| Book Titel: | Lecture Notes in Computer Science |
| Volume: | 5199 |
| Pages: | 847-858 |
| Keywords: | EMO |
| Publisher: | Springer |
| Abstract: | This paper pursues the idea of a general multiobjective optimizer that can be flexibly adapted to arbitrary user preferences—assuming that the goal is to approximate the Pareto-optimal set. It proposes the Set Preference Algorithm for Multiobjective Optimization (SPAM) the working principle of which is based on two observations: (i) current multiobjective evolutionary algorithms (MOEAs) can be regarded as hill climbers on set problems and (ii) specific user preferences are often (implicitly) expressed in terms of a binary relation on Pareto set approximations. SPAM realizes a (1 + 1)-strategy on the space of Pareto set approximations and can be used with any type of set preference relations, i.e., binary relations that define a total preorder on Pareto set approximations. The experimental results demonstrate for a range of set preference relations that SPAM provides full flexibility with respect to user preferences and is effective in optimizing according to the specified preferences. It thereby offers a new perspective on preference-guided multiobjective search. |
| Location: | Dortmund, Germany |
| Resources: | [BibTeX] [Paper as PDF] |
