Approximating the Pareto curve to help solve biobjective design problems

被引:10
|
作者
Fadel, G [1 ]
Li, Y [1 ]
机构
[1] Clemson Univ, Dept Mech Engn, Clemson, SC 29634 USA
关键词
multi-objective optimization; Pareto-set; trade-off decisions; approximation; trusses;
D O I
10.1007/s00158-002-0186-2
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
When faced with multiple objectives, designers have to find ways to combine these objectives to find the solution that satisfies acceptable trade-off levels. In this paper, we present a methodology based on approximating the Pareto set of biobjective problems and presenting these trade-off graphs to the designer to facilitate decisions on trade-off. Once a solution is selected from the approximated set, the designer can select to either set a target on one or both objectives and use one of two methods to find the sought after solution. The paper details the methodology and applies it to three structural problems of increasing complexity. showing that the procedure provides also useful feedback even in the case of nonconvex Pareto sets.
引用
收藏
页码:280 / 296
页数:17
相关论文
共 50 条
  • [1] Approximating the Pareto curve to help solve biobjective design problems
    G. Fadel
    Y. Li
    Structural and Multidisciplinary Optimization, 2002, 23 : 280 - 296
  • [2] Industry Centre to help solve design problems
    不详
    IEE REVIEW, 1996, 42 (06): : 222 - 222
  • [3] Numerical certification of Pareto optimality for biobjective nonlinear problems
    Audet, Charles
    Messine, Frederic
    Ninin, Jordan
    JOURNAL OF GLOBAL OPTIMIZATION, 2022, 83 (04) : 891 - 908
  • [4] Approximating biobjective minimization problems using general ordering cones
    Arne Herzel
    Stephan Helfrich
    Stefan Ruzika
    Clemens Thielen
    Journal of Global Optimization, 2023, 86 : 393 - 415
  • [5] Approximating biobjective minimization problems using general ordering cones
    Herzel, Arne
    Helfrich, Stephan
    Ruzika, Stefan
    Thielen, Clemens
    JOURNAL OF GLOBAL OPTIMIZATION, 2023, 86 (02) : 393 - 415
  • [6] Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems
    Charles Audet
    Frédéric Messine
    Jordan Ninin
    Journal of Global Optimization, 2022, 83 : 909 - 910
  • [7] Two-phase Pareto local search to solve the biobjective set covering problem
    Lust, Thibaut
    Tuyttens, Daniel
    2013 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2013, : 397 - 402
  • [8] SMALL APPROXIMATE PARETO SETS FOR BIOBJECTIVE SHORTEST PATHS AND OTHER PROBLEMS
    Diakonikolas, Ilias
    Yannakakis, Mihalis
    SIAM JOURNAL ON COMPUTING, 2009, 39 (04) : 1340 - 1371
  • [9] A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem
    Li, You
    Kou, Yingxin
    Li, Zhanwu
    Xu, An
    Chang, Yizhe
    INTERNATIONAL JOURNAL OF AEROSPACE ENGINEERING, 2017, 2017
  • [10] How to Solve Schrodinger Problems by Approximating the Potential Function
    Ledoux, Veerle
    Van Daele, Marnix
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III, 2010, 1281 : 652 - 655