Abstract

Cooperative co-evolution (CC) provides the divide-and-conquer framework for solving large-scale global optimisation (LSGO) problems. Identification of variable interactions is the main challenge in CC. Differential grouping (DG) is a competitive approach to find the identification and Global DG (GDG) is its improvement by introducing the global information. In this paper, a self-adaptive DG (SDG) is proposed for further improving the grouping accuracy of GDG. The threshold for grouping in SDG can adjust adaptively along with the magnitude of different functions and is determined by only two points which is a randomly sampled point and its corresponding opposite point. A self-adaptive pyramid allocation (SPA) for computational resources is also studied. The proposed algorithm, with SDG, SPA, and the optimiser SaNSDE, is used to solve the CEC'2010 LSGO benchmark suite. Experimental results show that SDG achieved ideal decomposition for all the functions and the proposed algorithm obtained competitive optimisation performance.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call