期刊
INFORMATION SCIENCES
卷 430, 期 -, 页码 397-413出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2017.11.052
关键词
Evolutionary optimization; Multi-objective optimization; Archive; Decomposition
资金
- National Natural Science Foundation of China [61473299, 61573279, 61573326, 11301494]
- Jiangsu Six Talents Peaks Project of Province [DZXX-053]
- Outstanding Innovation Team of China University of Mining and Technology [2015QN003]
External archive can be used to improve the performance of a multi-objective evolutionary algorithm. Various archiving approaches have been developed but with some drawbacks. These drawbacks such as computation-inefficiency, retreating and shrinking, have not yet been well addressed. In this paper, we propose an efficient decomposition-based archiving approach (DAA) inspired from the decomposition strategy for dealing with multi-objective optimization. In DAA, the whole objective space is uniformly divided into a number of subspaces according to a set of weight vectors. At each generation, only one non-dominated solution lying in a subspace is chosen to be used for updating the external archive in consideration of its diversity. A normalized distance-based method, incorporated with the Pareto dominance, is proposed to decide which subspace a new solution should fall into, and whether this solution should replace existing one in this subspace or not. Empirical results on a diverse set of benchmark test problems show that DAA is more efficient than a number of state-of-the-art archiving methods in terms of the diversity of the obtained non-dominated solutions; and DAA can accelerate the convergence speed of the evolutionary search for most test problems. (C) 2017 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据