Solving large-scale many-objective optimization problems by covariance matrix adaptation evolution strategy with scalable small subpopulations

  • Huangke Chen
  • , Ran Cheng
  • , Jinming Wen
  • , Haifeng Li
  • , Jian Weng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

173 Citations (Scopus)

Abstract

Despite the recent development in evolutionary multi- and many-objective optimization, the problems with large-scale decision variables still remain challenging. In this work, we propose a scalable small subpopulations based covariance matrix adaptation evolution strategy, namely S3-CMA-ES, for solving many-objective optimization problems with large-scale decision variables. The proposed S3-CMA-ES attempts to approximate the set of Pareto-optimal solutions using a series of small subpopulations instead of a whole population, where each subpopulation converges to only one solution. In the proposed S3-CMA-ES, a diversity improvement strategy is designed to generate and select new solutions. The performance of S3-CMA-ES is compared with five representative algorithms on 36 test instances with 5–15 objectives and 500–1500 decision variables. The empirical results demonstrate the superiority of the proposed S3-CMA-ES.

Original languageEnglish
Pages (from-to)457-469
Number of pages13
JournalInformation Sciences
Volume509
DOIs
Publication statusPublished - Jan 2020
Externally publishedYes

Keywords

  • CMA-ES
  • Evolutionary algorithm
  • Large-scale multi-objective optimization
  • Many-objective optimization
  • Scalable populations

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Solving large-scale many-objective optimization problems by covariance matrix adaptation evolution strategy with scalable small subpopulations'. Together they form a unique fingerprint.

Cite this