Incorporating user preferences in many-objective optimization using relation ε-preferred

Abstract

Abstract:During the last 10 years, many-objective optimization problems, i.e. optimization problems with more than three objectives, are getting more and more important in the area of multi-objective optimization. Many realworld optimization problems consist of more than three mutually dependent subproblems, that have to be considered in parallel. Furthermore, the objectives have different levels of importance. For this, priorities have to be assigned to the objectives. In this paper we present a new model for many-objective optimization called Prio-ε-Preferred, where the objectives can have different levels of priorities or user preferences. This relation is used for ranking a set of solutions such that an ordering of the solutions is determined. Prio-ε-Preferred is controlled by a parameter ε, that is problem specific and has to be adjusted experimentally by the designer. Therefore we also present an extension called Adapted-ε-Preferred (AEP), that determines the ε values automatically without any user interaction. To demonstrate the efficiency of our approach, experiments are performed.

We’re Not Gonna Break It! Consistency-Preserving Operators for Efficient Product Line Configuration

“…All three tools show small standard deviations between solutions, indicating a high robustness [27]. That is, the variance between the solutions found in different runs is small-an important criterion for practical use where it is not feasible to execute many runs and select the best results.…”

An Adaptive Metric for Node Substitution-Based BDD Minimization

“…Shirinzadeh et al have employed a genetic algorithm for synthesizing ROBDDs that represent an approximate Boolean function [2]. They use different approaches to optimize the multi-objective cost function that guides the search for an approximate ROBDD (A-ROBDD) within specified error constraints [2]- [4]. Soeken et al have made use of rounding operations for approximating Binary Decision Diagrams (BDDs) [5].…”

Many-Objective Cooperative Co-evolutionary Feature Selection: A Lexicographic Approach

“…Although some attempts have been made to support objective priorities in EAs [9,29], a much simpler approach is possible if the problem allows to set a different priority level for each objective. This approach, which was initially proposed in 1975 [25], is lexicographic optimization, and problems meeting this restriction are also known as Lexicographic MOPs (LMOPs) [18].…”