2009
DOI: 10.1162/evco.2009.17.3.411
|View full text |Cite
|
Sign up to set email alerts
|

A Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

Abstract: In this paper, we discuss the idea of incorporating preference information into evolutionary multi-objective optimization and propose a preference-based evolutionary approach that can be used as an integral part of an interactive algorithm. One algorithm is proposed in the paper. At each iteration, the decision maker is asked to give preference information in terms of his or her reference point consisting of desirable aspiration levels for objective functions. The information is used in an evolutionary algorit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
204
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 332 publications
(204 citation statements)
references
References 23 publications
0
204
0
Order By: Relevance
“…We will not discuss further properties here and instead refer to [18], [20], [35] for detailed reviews of binary indicators. Preference information of a decision maker can be considered in the above binary epsilon indicator by extending the concepts described in [28] for pairs of solutions to sets. In order to prefer solutions that are close to a set of reference points r ∈ R in the objective space, we use the concept of an achievement function with respect to a reference point r s(x, r) = max where the specificity δ > 0 determines the minimal value of the normalized function and P denotes the current set of solutions.…”
Section: Proof: Consider a B ∈ ψ With (A B) ∧ (B A) If I(a B) ≤ I(mentioning
confidence: 99%
“…We will not discuss further properties here and instead refer to [18], [20], [35] for detailed reviews of binary indicators. Preference information of a decision maker can be considered in the above binary epsilon indicator by extending the concepts described in [28] for pairs of solutions to sets. In order to prefer solutions that are close to a set of reference points r ∈ R in the objective space, we use the concept of an achievement function with respect to a reference point r s(x, r) = max where the specificity δ > 0 determines the minimal value of the normalized function and P denotes the current set of solutions.…”
Section: Proof: Consider a B ∈ ψ With (A B) ∧ (B A) If I(a B) ≤ I(mentioning
confidence: 99%
“…Hwang et al, 1979) have been developed in order to interactively explore the Pareto space without having to fully compute it in advance, thus mitigating the associate computational burden (e.g. Thiele et al, 2009). The complexity and high number of questions to be posed to the stakeholders remain an unsolved problem (Larichev, 1992).…”
Section: Current Statusmentioning
confidence: 99%
“…The latter algorithm also integrated the DM to control the achievable accuracy of non-dominated solutions. A self-adaptive version of the ε logic is proposed in [62] To overcome the shortcomings of not having preference information in the selection process of the Indicator-Based Evolutionary Algorithm (IBEA) [77], the Preference-Based Evolutionary Algorithm (PBEA) was introduced in [65]. In [3] an approach that integrates the DM's preferences into an estimation of the dominated portion of the objective space (hypervolume) is presented.…”
Section: Progressive Preference Articulation: a Brief Reviewmentioning
confidence: 99%