An evolutionary algorithm with double-level archives for multiobjective optimization

Chen, Ni and Chen, Wei-Neng and Gong, Yue-Jiao and Zhan, Zhi-Hui and Zhang, Jun and Li, Yun and Tan, Yu-Song (2015) An evolutionary algorithm with double-level archives for multiobjective optimization. IEEE Transactions on Cybernetics, 45 (9). pp. 1851-1863. ISSN 2168-2275 (

[thumbnail of Chen-etal-IEEETC2014-An-evolutionary-algorithm-with-double-level-archives-for]
Text. Filename: Chen_etal_IEEETC2014_An_evolutionary_algorithm_with_double_level_archives_for.pdf
Final Published Version

Download (2MB)| Preview


Existing multiobjective evolutionary algorithms (MOEAs) tackle a multiobjective problem either as a whole or as several decomposed single-objective sub-problems. Though the problem decomposition approach generally converges faster through optimizing all the sub-problems simultaneously, there are two issues not fully addressed, i.e., distribution of solutions often depends on a priori problem decomposition, and the lack of population diversity among sub-problems. In this paper, a MOEA with double-level archives is developed. The algorithm takes advantages of both the multiobjective-problem-level and the sub-problem-level approaches by introducing two types of archives, i.e., the global archive and the sub-archive. In each generation, self-reproduction with the global archive and cross-reproduction between the global archive and sub-archives both breed new individuals. The global archive and sub-archives communicate through cross-reproduction, and are updated using the reproduced individuals. Such a framework thus retains fast convergence, and at the same time handles solution distribution along Pareto front (PF) with scalability. To test the performance of the proposed algorithm, experiments are conducted on both the widely used benchmarks and a set of truly disconnected problems. The results verify that, compared with state-of-the-art MOEAs, the proposed algorithm offers competitive advantages in distance to the PF, solution coverage, and search speed.