2004
DOI: 10.1007/978-3-540-24855-2_2
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Uniform Scaling for Multiobjective Genetic Algorithms

Abstract: Abstract. Before Multiobjective Evolutionary Algorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further investigation. One of these issues is how a uniform distribution of solutions along the Pareto non-dominated front can be obtained for badly scaled objective functions. This is especially a problem if the bounds for the objective functions are unknown, which may result in the nondominated solutions found by the MOEA to be … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…As in [11], ρ adjusts the degree of scaling between objectives, and f2 is much larger scaling than f1 as ρ increases from the value of 1.0. To make matters worse, the function g( y) involves (multivariate) interactions between variables.…”
Section: Test Problemmentioning
confidence: 97%
See 2 more Smart Citations
“…As in [11], ρ adjusts the degree of scaling between objectives, and f2 is much larger scaling than f1 as ρ increases from the value of 1.0. To make matters worse, the function g( y) involves (multivariate) interactions between variables.…”
Section: Test Problemmentioning
confidence: 97%
“…A new test problem can be designed from [11]. It has two important issues that are not encountered in usual benchmark MOPs; scaling (of objectives) and dependency (of variables).…”
Section: Test Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…If the same selection mechanisms are applied to scaling problems, the desired behavior may not be forthcoming. This is because the selection mechanisms that largely exploit Pareto dominance find it hard to break the barrier of badly-scaled objectives (i.e., highly-skewed distribution of solutions) [3,21]. Without a doubt, the selection schemes (i.e., BTS, -DS, and IBS) intensively depend on the Pareto dominance.…”
Section: Existing Approachesmentioning
confidence: 97%
“…Often, it becomes difficult to obtain a uniform distribution of solutions along the Pareto front when the objective values do not operate over a comparable scale [21]. This is because the scaling evolves individuals in the direction of particular objectives.…”
Section: Introductionmentioning
confidence: 98%