Multipopulation evolution framework for multifactorial optimization

49Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

Multifactorial 1 Optimization (MFO) has been attracting considerable attention in the evolutionary computation community. In this paper, we propose a general multi-population evolution framework (MPEF) for MFO, wherein each population has its own random mating probability (rmp) and is used for its own task. The benefits of using MPEF are twofold: 1) Various well-developed evolutionary algorithms (EAs) can be easily embedded into MPEF for solving the task(s) of MFO problems; 2) Different populations can implement different genetic material transfers. Moreover, for instantiation, we embed a powerful differential evolution algorithm, namely SHADE, into MPEF to form a multipopulation DE algorithm (MPEF-SHADE) for solving MFO problems. The experimental results on nine MFO benchmark problems show that MPEF-SHADE is significantly better than or at least competitive with other multifactorial evolution algorithms, such as MFEA, MFDE, MFPSO and AMA.

Cite

CITATION STYLE

APA

Li, G., Zhang, Q., & Gao, W. (2018). Multipopulation evolution framework for multifactorial optimization. In GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion (pp. 215–216). Association for Computing Machinery, Inc. https://doi.org/10.1145/3205651.3205761

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free