location: Current position: Home >> Scientific Research >> Paper Publications

A Many-Objective Evolutionary Algorithm with Fast Clustering and Reference Point Redistribution

Hits:

Indexed by:会议论文

Date of Publication:2018-01-01

Included Journals:CPCI-S

Page Number:39-46

Abstract:The design of effective evolutionary many-objective optimization algorithms is challenging for the difficulties in obtaining proximity while maintaining diversity. In this paper, a fast Clustering based Algorithm with reference point Redistribution (fastCAR) is proposed. In the clustering process, a fast Pareto dominance based clustering mechanism is proposed to increase the evolution selection pressure that acts as a selection operator. In the redistribution process, the reference vectors are periodically redistributed by using an SVM classifier to maintain the diversity of the population without extra burden on fitness evaluations. The experimental results show that the proposed algorithm fastCAR obtains competitive results on box-constrained CEC'2018 many-objective benchmark functions in comparison with 8 state-of-the-art algorithms.

Pre One:Unsupervised Transformation Network Based on GANs for Target-domain Oriented Multi-domain Image Translation

Next One:Unsupervised Transformation Network Based on GANs for Target-Domain Oriented Image Translation