2015
DOI: 10.7463/0412.0363023
|View full text |Cite
|
Sign up to set email alerts
|

Review: population methods of Pareto set approximation in multi-objective optimization problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In essence, this form of convolution (2) is similar to the convolution of the ideal point method [8], which is in turn close to Germeyer's convolution [9]. As shown by Karpenko et al [8], these convolutions, make it possible to find optimal solutions, both for convex and for non-convex Pareto sets.…”
Section: Accounting For Multi-criteria In the Optimization Problemmentioning
confidence: 94%
See 1 more Smart Citation
“…In essence, this form of convolution (2) is similar to the convolution of the ideal point method [8], which is in turn close to Germeyer's convolution [9]. As shown by Karpenko et al [8], these convolutions, make it possible to find optimal solutions, both for convex and for non-convex Pareto sets.…”
Section: Accounting For Multi-criteria In the Optimization Problemmentioning
confidence: 94%
“…1, the two-dimensional normalized criterion space of each variant of flow path design is characterized by the corresponding point, whose distance to the center of the coordinates is proportional to the value ‖ ( , )‖. In essence, this form of convolution (2) is similar to the convolution of the ideal point method [8], which is in turn close to Germeyer's convolution [9]. As shown by Karpenko et al [8], these convolutions, make it possible to find optimal solutions, both for convex and for non-convex Pareto sets.…”
Section: Accounting For Multi-criteria In the Optimization Problemmentioning
confidence: 99%