Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/162386
Title: A multiobjective evolutionary algorithm based on objective-space localization selection
Authors: Zhou, Yuren
Chen, Zefeng
Huang, Zhengxin
Xiang, Yi
Keywords: Engineering::Computer science and engineering
Issue Date: 2020
Source: Zhou, Y., Chen, Z., Huang, Z. & Xiang, Y. (2020). A multiobjective evolutionary algorithm based on objective-space localization selection. IEEE Transactions On Cybernetics, 52(5), 3888-3901. https://dx.doi.org/10.1109/TCYB.2020.3016426
Journal: IEEE Transactions on Cybernetics
Abstract: This article proposes a simple yet effective multiobjective evolutionary algorithm (EA) for dealing with problems with irregular Pareto front. The proposed algorithm does not need to deal with the issues of predefining weight vectors and calculating indicators in the search process. It is mainly based on the thought of adaptively selecting multiple promising search directions according to crowdedness information in local objective spaces. Concretely, the proposed algorithm attempts to dynamically delete an individual of poor quality until enough individuals survive into the next generation. In this environmental selection process, the proposed algorithm considers two or three individuals in the most crowded area, which is determined by the local information in objective space, according to a probability selection mechanism, and deletes the worst of them from the current population. Thus, these surviving individuals are representative of promising search directions. The performance of the proposed algorithm is verified and compared with seven state-of-the-art algorithms [including four general multi/many-objective EAs and three algorithms specially designed for dealing with problems with irregular Pareto-optimal front (PF)] on a variety of complicated problems with different numbers of objectives ranging from 2 to 15. Empirical results demonstrate that the proposed algorithm has a strong competitiveness power in terms of both the performance and the algorithm compactness, and it can well deal with different types of problems with irregular PF and problems with different numbers of objectives.
URI: https://hdl.handle.net/10356/162386
ISSN: 2168-2267
DOI: 10.1109/TCYB.2020.3016426
Rights: © 2020 IEEE. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

SCOPUSTM   
Citations 50

2
Updated on Nov 25, 2022

Web of ScienceTM
Citations 50

3
Updated on Nov 19, 2022

Page view(s)

8
Updated on Nov 26, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.