The normalized normal constraint method for generating the Pareto frontier

被引:562
|
作者
Messac, A [1 ]
Ismail-Yahaya, A [1 ]
Mattson, CA [1 ]
机构
[1] Rensselaer Polytech Inst, Dept Mech Aerosp & Nucl Engn, Multidisciplinary Design & Optimizat Lab, Troy, NY 12180 USA
关键词
design optimization; multiobjective optimization; normal constraint; Pareto generation; Pareto filter;
D O I
10.1007/s00158-002-0276-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
dThe authors recently proposed the normal constraint (NC) method for generating a set of evenly spaced solutions on a Pareto frontier - for multiobjective optimization problems. Since few methods offer this desirable characteristic, the new method can be of significant practical use in the choice of an optimal solution in a multiobjective setting. This paper's specific contribution is two-fold. First, it presents a new formulation of the NC method that incorporates a critical linear mapping of the design objectives. This mapping has the desirable property that the resulting performance of the method is entirely independent of the design objectives scales. We address here the fact that scaling issues can pose formidable difficulties. Secondly, the notion of a Pareto filter is presented and an algorithm thereof is developed. As its name suggests, a Pareto filter is an algorithm that retains only the global Pareto points, given a set of points in objective space. As is explained in the paper, the Pareto filter is useful in the application of the NC and other methods. Numerical examples are provided.
引用
收藏
页码:86 / 98
页数:13
相关论文
共 50 条
  • [41] The Pareto Frontier of Inefficiency in Mechanism Design
    Filos-Ratsikas, Aris
    Giannakopoulos, Yiannis
    Lazos, Philip
    MATHEMATICS OF OPERATIONS RESEARCH, 2022, 47 (02) : 923 - 944
  • [42] Visualization of the Moving Pareto Frontier in DSS
    Brusnikina, N. B.
    Lotov, A. V.
    SCIENTIFIC AND TECHNICAL INFORMATION PROCESSING, 2011, 38 (05) : 322 - 331
  • [43] EFFICIENT METHOD FOR GENERATING STRONG PRIMES WITH CONSTRAINT OF BIT LENGTH
    LAIH, CS
    YANG, WC
    CHEN, CH
    ELECTRONICS LETTERS, 1991, 27 (20) : 1807 - 1808
  • [44] The Pareto Frontier of Inefficiency in Mechanism Design
    Filos-Ratsikas, Aris
    Giannakopoulos, Yiannis
    Lazos, Philip
    WEB AND INTERNET ECONOMICS, WINE 2019, 2019, 11920 : 186 - 199
  • [45] Comparison of two Pareto frontier approximations
    Berezkin, V. E.
    Lotov, A. V.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2014, 54 (09) : 1402 - 1410
  • [46] Comparison of two Pareto frontier approximations
    V. E. Berezkin
    A. V. Lotov
    Computational Mathematics and Mathematical Physics, 2014, 54 : 1402 - 1410
  • [47] Constraint proposal method for computing Pareto solutions in multi-party negotiations
    Heiskanen, P
    Ehtamo, H
    Hämäläinen, RP
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 133 (01) : 44 - 61
  • [48] A NOTE ON A REJECTION METHOD FOR GENERATING RANDOM VARIATES FROM THE DISCRETE PARETO DISTRIBUTION
    BARINGHAUS, L
    UTILITAS MATHEMATICA, 1989, 35 : 65 - 66
  • [49] A new Pareto set generating method for multi-criteria optimization problems
    Ghosh, Debdas
    Chakraborty, Debjani
    OPERATIONS RESEARCH LETTERS, 2014, 42 (08) : 514 - 521
  • [50] A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization
    Utyuzhnikov, S. V.
    Fantini, P.
    Guenov, M. D.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 223 (02) : 820 - 841