A novel two-archive strategy for evolutionary many-objective optimization algorithm based on reference points

Rui Ding

doi:10.1016/j.asoc.2019.02.040

Return

A novel two-archive strategy for evolutionary many-objective optimization algorithm based on reference points

2019-05-01

DOI：10.1016/j.asoc.2019.02.040

Original

Save

View PDF

Abstract

En 中文

Current evolutionary many-objective optimization algorithms face two challenges: one is to ensure population diversity for searching the entire solution space. The other is to ensure quick convergence to the optimal solution set. In this paper, we propose a novel two-archive strategy for evolutionary many-objective optimization algorithm. The uniform archive strategy, based on reference points, is used to keep population diversity in the evolutionary process, and to ensure that an evolutionary algorithm is able to search the entire solution space. The single elite archive strategy is used to ensure that individuals with the best single objective value are able to evolve into the next generation and have more opportunities to generate offspring. This strategy aims to improve the convergence rate. Then this novel two-archive strategy is applied to improving the Non-dominated Sorting Genetic Algorithm (NSGA-III). Simulation experiments are conducted on benchmark test sets and experimental results show that our proposed algorithm with the two-archive strategy has a better performance than other state-of-art algorithms. (C) 2019 Published by Elsevier B.V.

Keywords:

Many-objective optimization

Evolutionary algorithms

Reference points

Two-archive

Decomposition

AI Summary

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