Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA

被引：37
作者：
Aittokoski, T. [1 ]
Miettinen, K. [1 ]
机构：
[1] Univ Jyvaskyla, Dept Math Informat Technol, FI-40014 Agora, Finland
来源：
OPTIMIZATION METHODS & SOFTWARE | 2010年 / 25卷 / 06期
关键词：
efficient Pareto-optimal set approximation; multicriteria optimization; population-based approaches; Pareto-optimality; non-dominance; EMO; DECISION-MAKING; CONVERGENCE; ADAPTATION; ALGORITHM;
D O I：
10.1080/10556780903548265
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.
引用
收藏
页码：841 / 858
页数：18
相关论文
共 53 条
[1]   Cost effective simulation-based multiobjective optimization in the performance of an internal combustion engine [J].
Aittokoski, Timo ;
Miettinen, Kaisa .
ENGINEERING OPTIMIZATION, 2008, 40 (07) :593-612
[2]   Clustering aided approach for decision making in computationally expensive multiobjective optimization [J].
Aittokoski, Timo ;
Ayramo, Sami ;
Miettinen, Kaisa .
OPTIMIZATION METHODS & SOFTWARE, 2009, 24 (02) :157-174
[3]  
[Anonymous], 2001, PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON INFORMATION SCIENCE INNOVATIONS IN ENGINEERING OF NATURAL AND ARTIFICIAL INTELLIGENT SYSTEMS ISI 2001
[4]  
[Anonymous], 2007, EVOLUTIONARY ALGORIT
[5]  
BABU BV, 2003, P 2 INT C COMP INT R, P25
[6]  
BADER J, 2008, 286 TIK COMP ENG NET
[7]  
Bringmann K, 2009, LECT NOTES COMPUT SC, V5467, P6, DOI 10.1007/978-3-642-01020-0_6
[8]  
Cao Y., 2008, MATLAB CENTRAL FILE
[9]  
CRAFT D, 2008, MATLAB CENTRAL FILE
[10]  
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
123456