Reference Point Based NSGA-III for Preferred Solutions

被引:0
作者
Vesikar, Yash [1 ]
Deb, Kalyanmoy [1 ]
Blank, Julian [2 ]
机构
[1] Michigan State Univ, Dept Elect & Comp Engn, E Lansing, MI 48824 USA
[2] Michigan State Univ, Dept Comp Sci & Engn, E Lansing, MI 48824 USA
来源
2018 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI) | 2018年
基金
美国国家科学基金会;
关键词
Reference point approach; interactive multi-objective decision making; multi-objective optimization; EMO; NONDOMINATED SORTING APPROACH; ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The recent advances in evolutionary many-objective optimization (EMOs) have allowed for efficient ways of finding a number of dives-se trade-off solutions in three to I5-objective problems. However, there are at least two reasons why the users are, in some occasions, interested in finding a part, instead of the entire Pareto-optimal front. First, after analyzing the obtained trade-off solutions by an EMO algorithm, the user may be interested in concentrating in a specific preferred region of the Pareto-optimal front, either to obtain additional solutions in the region of interest or to investigate the nature of solutions in the preferred region. Second, the user may already have a well-articulated preference among objectives and is straightaway interested in finding preferred solutions. In this paper, we suggest a reference point based evolutionary many-objective optimization procedure for achieving both of these purposes. Additionally, we suggest an extended version of a previously proposed reference-point based evolutionary multi-objective optimization method. Our proposed procedures are capable of handling more than one reference point simultaneously. We demonstrate the working of our proposed procedures on a number of test and real-world problems. The results are encouraging and suggest the use of the concept to other evolutionary many-objective optimization algorithms for further study.
引用
收藏
页码:1587 / 1594
页数:8
相关论文
共 16 条
[1]  
[Anonymous], 2001, P 5 C EVOLUTIONARY M
[2]  
[Anonymous], 2006, INT J COMPUT INTELL, DOI DOI 10.5019/J.IJCIR.2006.67
[3]  
Branke J., 2004, KNOWLEDGE INCORPORAT, P461
[4]  
Coello C. A. C., 2007, Evolutionary algorithms for solving multi-objective problems, V5
[5]  
Corne D. W., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P839
[6]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]  
Deb K., 2001, MULTIOBJECTIVE OPTIM, V16
[9]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[10]   A fuzzy definition of "optimality" for many-criteria optimization problems [J].
Farina, M ;
Amato, P .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2004, 34 (03) :315-326