arrow
返回

An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints

delete2014-08-01
delete4.5K
PRE
AI
K
Kalyanmoy Deb *
H
Himanshu Jain
DOI:10.1109/TEVC.2013.2281535delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Having developed multiobjective optimization algorithms using evolutionary optimization methods and demonstrated their niche on various practical problems involving mostly two and three objectives, there is now a growing need for developing evolutionary multiobjective optimization (EMO) algorithms for handling many-objective (having four or more objectives) optimization problems. In this paper, we recognize a few recent efforts and discuss a number of viable directions for developing a potential EMO algorithm for solving many-objective optimization problems. Thereafter, we suggest a reference-point-based many-objective evolutionary algorithm following NSGA-II framework (we call it NSGA-III) that emphasizes population members that are nondominated, yet close to a set of supplied reference points. The proposed NSGA-III is applied to a number of many-objective test problems with three to 15 objectives and compared with two versions of a recently suggested EMO algorithm (MOEA/D). While each of the two MOEA/D methods works well on different classes of problems, the proposed NSGA-III is found to produce satisfactory results on all problems considered in this paper. This paper presents results on unconstrained problems, and the sequel paper considers constrained and other specialties in handling many-objective optimization problems.
Keyword:
Evolutionary computation
large dimension
many-objective optimization
multicriterion optimization
nondominated sorting
NSGA-III

期刊

IEEE Transactions on Evolutionary Computation 封面图
IEEE Transactions on Evolutionary Computation
IF:
12
论文数:
1.8K
被引数:
2.4W

机构

I
indian institute of technology system (iit system)
学者数:
9.5W
论文数: 9.9W
被引数: 93
M
michigan state university
学者数:
3.6W
论文数: 3.2W
被引数: 44
引用论文

引用论文

A Fast Incremental Hypervolume Algorithm
err2008-12-01
err67
errOAAI
errBradstreet, Lucas; While, Lyndon; Barone, Luigi
err分享
err收藏
学者 查看更多内容