2003
DOI: 10.1007/978-3-642-18965-4_10
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective Evolutionary Algorithms: Introducing Bias Among Pareto-optimal Solutions

Abstract: Summary. Sin ce the beginning of the 1990s, research and applicat ion of multiobjective evoluti ona ry algorithms (MOEAs) have a tt rac te d increasing at te nt ion. This is mainly du e to t he abilit y of evolut iona ry algorit hms to find multiple P ar etooptimal solutions in one single simulation run. In thi s chapte r, we present a n overview of MO EAs and then discuss a particular algorit hm in detail. Although MOEAs ca n find multiple Par et o-optimal solutions, oft en, users need to impose a pa rti cula… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
60
0
4

Year Published

2006
2006
2021
2021

Publication Types

Select...
3
3
3

Relationship

1
8

Authors

Journals

citations
Cited by 100 publications
(64 citation statements)
references
References 24 publications
0
60
0
4
Order By: Relevance
“…Although G-MOEA is more flexible and intuitive than other approaches, it is not always an easy task for the decision maker to specify the trade-off between objectives, especially for many-objective problems. Deb [22] applied bias sharing technique on NSGA [23] where the biased Pareto-optimal solutions are generated on a desired region by changing the weights. An objective with a higher priority takes a higher weight value.…”
Section: User-preference Based Emo Algorithmsmentioning
confidence: 99%
“…Although G-MOEA is more flexible and intuitive than other approaches, it is not always an easy task for the decision maker to specify the trade-off between objectives, especially for many-objective problems. Deb [22] applied bias sharing technique on NSGA [23] where the biased Pareto-optimal solutions are generated on a desired region by changing the weights. An objective with a higher priority takes a higher weight value.…”
Section: User-preference Based Emo Algorithmsmentioning
confidence: 99%
“…[38,39,40]). 2.Those in which the DM makes pair-wise comparisons on a subset of the current population, in order to rank the sample's solutions (e.g.…”
Section: A Brief Outline and Some Criticisms Of Previous Approachesmentioning
confidence: 99%
“…According to Bechikh ([35]), the most commonly used ways are the following:  those in which importance factors (weights) are assigned by the DM to each objective function (e.g. [36,37]),  those in which the DM makes pair-wise comparisons on a subset of the current population in order to rank the sample's solutions (e.g. [38,39]),  when pair-wise comparisons between pairs of objective functions are performed in order to rank the set of objective functions (e.g.…”
Section: Preference Incorporation In Multicriteria Optimization Metahmentioning
confidence: 99%