Introducing robustness in multi-objective optimization

被引:352
作者
Deb, Kalyanmoy [1 ]
Gupta, Himanshu
机构
[1] Indian Inst Technol, KanGAL, Kanpur 208016, Uttar Pradesh, India
[2] Indian Inst Technol, IBM India Res Lab, New Delhi 110016, India
关键词
multi-objective optimization; evolutionary algorithms; robust solutions; paretooptimal solutions; global and local optimal solutions;
D O I
10.1162/evco.2006.14.4.463
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In optimization studies including multi-objective optimization, the main focus is placed on finding the global Optimum or global Pareto-optimal solutions, representing the best possible objective values. However, in practice, users may not always be interested in finding the so-called global best solutions, particularly when these solutions are quite sensitive to the variable perturbations which cannot be avoided in practice. In such cases, practitioners are interested in finding the robust solutions which are less sensitive to small perturbations in variables. Although robust optimization is dealt with in detail in single-objective evolutionary optimization studies, in this paper, we present two different robust multi-objective optimization procedures, where the emphasis is to find a robust frontier, instead of the global Pareto-optimal frontier in a problem. The first procedure is a straightforward extension of a technique used for single-objective optimization and the second procedure is a more practical approach enabling a user to set the extent of robustness desired in a problem. To demonstrate the differences between global and robust multi-objective optimization principles and the differences between the two robust optimization procedures suggested here, we develop a number of constrained and unconstrained test problems having two and three objectives and show simulation results using an evolutionary multi-objective optimization (EMO) algorithm. Finally, we also apply both robust optimization methodologies to an engineering design problem.
引用
收藏
页码:463 / 494
页数:32
相关论文
共 18 条
  • [1] Branke J, 1998, LECT NOTES COMPUT SC, V1498, P119, DOI 10.1007/BFb0056855
  • [2] BRANKE J, 2000, SOFT COMPUT, V9, P13
  • [3] BRANKE J, 2000, ADAPTIVE COMPUTING D, P275
  • [4] Coello C. A. C., 2002, EVOLUTIONARY ALGORIT
  • [5] Deb K, 2005, LECT NOTES COMPUT SC, V3410, P150
  • [6] OPTIMAL-DESIGN OF A WELDED BEAM VIA GENETIC ALGORITHMS
    DEB, K
    [J]. AIAA JOURNAL, 1991, 29 (11) : 2013 - 2015
  • [7] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [8] Deb K, 2000, EVOLUTIONARY DESIGN AND MANUFACTURE, P225
  • [9] Deb K., 2001, Multi-Objective Optimization using Evolutionary Algorithms
  • [10] HUGHES EJ, 2001, P 1 INT C EV MULT OP, P329