A new approach to approximate the bounded Pareto front

被引：11
|
作者：
Khaledian, Kazhal [1 ]
Soleimani-damaneh, Majid [2 ,3 ]
机构：
[1] Amirkabir Univ Technol, Fac Math & Comp Sci, Tehran 15914, Iran
[2] Univ Tehran, Sch Math Stat & Comp Sci, Coll Sci, Tehran, Iran
[3] Inst Res Fundamental Sci IPM, Sch Math, Tehran, Iran
来源：
MATHEMATICAL METHODS OF OPERATIONS RESEARCH | 2015年 / 82卷 / 02期
关键词：
Multiple-objective optimization; Pareto front; Boundary of the Pareto front; Indifferent regions; NBI method; MULTIOBJECTIVE OPTIMIZATION PROBLEMS; NUMERICAL-METHOD;
D O I：
10.1007/s00186-015-0510-4
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, a sequential approach, recently addressed by Mueller-Gritschneder et al. [SIAM J Optim 20(2):915-934, 2009] is studied. After a brief review, some weaknesses of the mentioned approach are pointed out. These weaknesses are due to a redundant assumption and the inability to generate the entire Pareto front. We present two improvements for the mentioned approach, firstly by eliminating the assumption of equality between the Pareto front and the weak Pareto front and secondly by presenting a new definition of the boundary of the Pareto front and establishing some theoretical results about it.
引用
收藏
页码：211 / 228
页数：18
相关论文
共 50 条
  • [1] A new approach to approximate the bounded Pareto front
    Kazhal Khaledian
    Majid Soleimani-damaneh
    [J]. Mathematical Methods of Operations Research, 2015, 82 : 211 - 228
  • [2] A SUCCESSIVE APPROACH TO COMPUTE THE BOUNDED PARETO FRONT OF PRACTICAL MULTIOBJECTIVE OPTIMIZATION PROBLEMS
    Mueller-Gritschneder, Daniel
    Graeb, Helmut
    Schlichtmann, Ulf
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2009, 20 (02) : 915 - 934
  • [3] A RankMOEA to Approximate the Pareto Front of a Dynamic Principal-Agent Model
    Arturo Herrera-Ortiz, Juan
    Rodriguez-Vazquez, Katya
    Curiel Cabral, Itza T. Q.
    Di Giannatale Menegalli, Sonia
    [J]. GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 785 - 792
  • [4] Exact and approximate determination of the Pareto front using Minimal Correction Subsets
    Guerreiro, A. P.
    Cortes, J.
    Vanderpooten, D.
    Bazgan, C.
    Lynce, I.
    Manquinho, V
    Figueira, J. R.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2023, 153
  • [5] Dual population approximate constrained Pareto front for constrained multiobjective optimization
    Zhou, Jinlong
    Zhang, Yinggui
    Suganthan, P. N.
    [J]. INFORMATION SCIENCES, 2023, 648
  • [6] Hybrid approach for Pareto front expansion in heuristics
    Yapicioglu, H.
    Liu, H.
    Smith, A. E.
    Dozier, G.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (02) : 348 - 359
  • [7] Pareto Front Approximation Using A Hybrid Approach
    Deshpande, Shubhangi
    Watson, Layne T.
    Canfield, Robert A.
    [J]. 2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2013, 18 : 521 - 530
  • [8] A Generator for Multiobjective Test Problems With Difficult-to-Approximate Pareto Front Boundaries
    Wang, Zhenkun
    Ong, Yew-Soon
    Sun, Jianyong
    Gupta, Abhishek
    Zhang, Qingfu
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (04) : 556 - 571
  • [9] BOUNDED APPROXIMATE UNITS AND BOUNDED APPROXIMATE IDENTITIES
    WICHMANN, J
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 41 (02) : 547 - 550
  • [10] A Bounded Archiver for Hausdorff Approximations of the Pareto Front for Multi-Objective Evolutionary Algorithms
    Hernandez Castellanos, Carlos Ignacio
    Schutze, Oliver
    [J]. MATHEMATICAL AND COMPUTATIONAL APPLICATIONS, 2022, 27 (03)
12345