CBCC3 - A contribution-based cooperative co-evolutionary algorithm with improved exploration/exploitation balance

Mohammad Nabi OMIDVAR, Borhan KAZIMIPOUR, Xiaodong LI, Xin YAO

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

65 Citations (Scopus)

Abstract

Cooperative Co-evolution (CC) is a promising framework for solving large-scale optimization problems. However, the round-robin strategy of CC is not an efficient way of allocating the available computational resources to components of imbalanced functions. The imbalance problem happens when the components of a partially separable function have non-uniform contributions to the overall objective value. Contribution-Based Cooperative Co-evolution (CBCC) is a variant of CC that allocates the available computational resources to the individual components based on their contributions. CBCC variants (CBCC1 and CBCC2) have shown better performance than the standard CC in a variety of cases. In this paper, we show that over-exploration and over-exploitation are two major sources of performance loss in the existing CBCC variants. On that basis, we propose a new contribution-based algorithm that maintains a better balance between exploration and exploitation. The empirical results show that the new algorithm is superior to its predecessors as well as the standard CC. © 2016 IEEE.
Original languageEnglish
Title of host publication2016 IEEE Congress on Evolutionary Computation, CEC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3541-3548
Number of pages8
ISBN (Print)9781509006229
DOIs
Publication statusPublished - Jul 2016
Externally publishedYes

Bibliographical note

This work was partially supported by an EPSRC grant (No. EP/K001523/1) and ARC Discovery grant (No. DP120102205).

Fingerprint

Dive into the research topics of 'CBCC3 - A contribution-based cooperative co-evolutionary algorithm with improved exploration/exploitation balance'. Together they form a unique fingerprint.

Cite this