USP Electronic Research Repository

On the relationship of degree of separability with depth of evolution in decomposition for cooperative coevolution

Chandra, R. and Deo, Ratneel and Bali, Kavitesh and Sharma, Anuraganand (2016) On the relationship of degree of separability with depth of evolution in decomposition for cooperative coevolution. [Conference Proceedings]

[img]
Preview
PDF - Published Version
Available under License Creative Commons Attribution Non-commercial.

Download (294Kb) | Preview

    Abstract

    Problem decomposition determines how subcomponents are created that have a vital role in the performance of cooperative coevolution. Cooperative coevolution naturally appeals to fully separable problems that have low interaction amongst subcomponents. The interaction amongst subcomponents is defined by the degree of separability. Typically, in cooperative coevolution, each subcomponent is implemented as a sub-population that is evolved in a round-robin fashion for a specified depth of evolution. This paper examines the relationship between the depth of evolution and degree of separability for different types of global optimisation problems. The results show that the depth of evolution is an important attribute that affects the performance of cooperative coevolution and can be used to ascertain the nature of the problem in terms of the degree of separability.

    Item Type: Conference Proceedings
    Additional Information: DOI: 10.1109/CEC.2016.7744408
    Subjects: Q Science > Q Science (General)
    Divisions: Faculty of Science, Technology and Environment (FSTE) > School of Computing, Information and Mathematical Sciences
    Depositing User: Ratneel Deo
    Date Deposited: 05 Jan 2017 16:25
    Last Modified: 05 Jan 2017 16:25
    URI: http://repository.usp.ac.fj/id/eprint/9546
    UNSPECIFIED

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...