Journal
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
Volume 23, Issue 3, Pages 391-405Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2018.2866927
Keywords
Evolutionary algorithm (EA); hierarchical clustering; many-objective optimization; partitional clustering
Funding
- National Natural Science Foundation of China [61876110, 61772393, 61402291]
- Research Grants Council of the Hong Kong Special Administrative Region [CityU 21200816, CityU 11203217, CityU 11200218]
- CONACyT [221551]
Ask authors/readers for more resources
This paper suggests a novel clustering-based evolutionary algorithm for many-objective optimization problems. Its main idea is to classify the population into a number of clusters, which is expected to solve the difficulty of balancing convergence and diversity in high-dimensional objective space. The individuals showing high similarities on the vector angles are gathered into the same cluster, such that the population's distribution can be well portrayed by the clusters. To efficiently find these clusters, partitional clustering is first used to classify the union population into in main clusters based on the m axis vectors (m is the number of objectives), and then hierarchical clustering is further run on these in main clusters to get N final clusters (N is the population size and N > m). At last, in environmental selection, one individual from each of N clusters closest to the axis vectors is selected to maintain diversity, while one individual from each of the other clusters is preferred by a simple convergence indicator to ensure convergence. When tackling some well-known test problems with 5-15 objectives, extensive experiments validate the superiority of our algorithm over six competitive many-objective EAs, especially on problems with incomplete and irregular Pareto-optimal fronts.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available