2014
DOI: 10.1002/mcda.1515
|View full text |Cite
|
Sign up to set email alerts
|

Parametric Approximation of the Pareto Set in Multi‐Objective Optimization Problems

Abstract: In this paper, a methodology for the systematic parametric representation for approximating the Pareto set of multi‐objective optimization problems has been proposed. It leads to a parametrization of the solutions of a multi‐objective optimization problem in the design as well as in the objective space, which facilitates the task of a decision maker in a significant manner. This methodology exploits the properties of Fourier series basis functions to approximate the general form of (piecewise) continuous Paret… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…Optimizing only the control points of the Bézier curve, that define its curvature, enforces the decision variables of solutions in the approximation set to vary in a smooth, continuous fashion, thereby likely improving intuitive navigability of the approximation set. Previous work on parameterizations of the approximation set has been applied mainly in a post-processing step after optimization, or was performed in the objective space [3,15,19], but this does not aid in the navigability of the approximation set in decision space. Moreover, fitting a smooth curve through an already optimized set of solutions might result in a bad fit, resulting in a lower-quality approximation set.…”
Section: Introductionmentioning
confidence: 99%
“…Optimizing only the control points of the Bézier curve, that define its curvature, enforces the decision variables of solutions in the approximation set to vary in a smooth, continuous fashion, thereby likely improving intuitive navigability of the approximation set. Previous work on parameterizations of the approximation set has been applied mainly in a post-processing step after optimization, or was performed in the objective space [3,15,19], but this does not aid in the navigability of the approximation set in decision space. Moreover, fitting a smooth curve through an already optimized set of solutions might result in a bad fit, resulting in a lower-quality approximation set.…”
Section: Introductionmentioning
confidence: 99%
“…Optimizing only the control points of the Bézier curve, that define its curvature, enforces the decision variables of solutions in the approximation set to vary in a smooth, continuous fashion, thereby likely improving intuitive navigability of the approximation set. Previous work on parameterizations of the approximation set has been applied mainly in a post-processing step after optimization, or was performed in the objective space [17,3,24], but this does not aid in the navigability of the approximation set in decision space. Moreover, fitting a smooth curve through an already optimized set of solutions might result in a bad fit, resulting in a lower-quality approximation set.…”
Section: Introductionmentioning
confidence: 99%