arrow
Return

Binary search based boundary elimination selection in many-objective evolutionary optimization

delete2017-11-01
delete16
delete
OA
AI
余国 cover
余国 (Guo Yu)
R
Ruimin Shen
郑
郑金华 (Jinhua Zheng) *
M
Miqing Li
邹
邹娟 (Juan Zou)
Y
Yuan Liu
DOI:10.1016/j.asoc.2017.07.030delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In many-objective optimization, the balance between convergence and diversity is hard to maintain, while the dominance resistant solutions (DRSs) could further harm the balance particularly in high-dimensional objective space. Thus, this paper proposes a novel selection strategy - boundary elimination selection based on binary search (called BESBS), trying to avoid the impact of DRSs during the optimization and achieve a good balance between the convergence and diversity simultaneously. During the environmental selection, the binary search (BS) is used to adaptively adjust the epsilon value in the epsilon-dominance relationship and assist in detecting the well-distributed neighbors for the elite solutions. Then the epsilon value obtained by BS is used for serving the boundary elimination selection (BES) to guarantee the stability of the elite population. To improve the convergence, BES is mainly designed to select individuals approximating to the ideal point. By modifying the fitness of solutions and choosing solutions in terms of the shuffled sequence of objective axis, the DRSs will be eliminated during the selection. Thus, BESBS could achieve a good balance between the convergence and diversity and avoid the impact from DRSs simultaneously. From a series of experiments with 35 instances, the experimental results have shown that BESBS is competitive against 8 state-of-art many-objective evolutionary algorithms. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Many-objective optimization problems
Boundary elimination selection
Binary search
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

X
xiangtan university
Scholars:
1.5W
Papers: 9.2K
Citations: 8
Cited Papers

Cited Papers

Performance assessment of multiobjective optimizers: An analysis and review
err2003-04-01
err3.1K
errOAAI
errZitzler, E; Thiele, L; Laumanns, M; Fonseca, CM; da Fonseca, VG
errShare
errSave
errShare
errSave
Decomposing the user-preference in multiobjective optimization
err2015-07-02
err55
PREAI
errYu, Guo; Zheng, Jinhua; Shen, Ruimin; Li, Miqing
errShare
errSave
Carburizing
err
IF0
err1999-12-01
err0
PREAI
errGeoffrey Parrish
errShare
errSave
A faster algorithm for calculating hypervolume
err2006-02-01
err759
PREAI
errWhile, L; Hingston, P; Barone, L; Huband, S
errShare
errSave
researcher View more