Heterogeneous Cooperative Co-Evolution Memetic Differential Evolution Algorithm for Big Data Optimization Problems

• Published in: IEEE transactions on evolutionary computation Vol. 21; no. 2; pp. 315 - 327
• Main Authors: Sabar, Nasser R., Abawajy, Jemal, Yearwood, John
• Format: Journal Article
• Language: English
• Published: IEEE 01.04.2017
• Subjects: Adaptive algorithm; Benchmark testing; Big data; differential evolution (DE); Evolutionary computation; memetic algorithm; Memetics; meta-heuristics; Optimization; Search problems; Sociology
• ISSN: 1089-778X; 1941-0026
• DOI: 10.1109/TEVC.2016.2602860

Evolutionary algorithms (EAs) have recently been suggested as a candidate for solving big data optimization problems that involve a very large number of variables and need to be analyzed in a short period of time. However, EAs face a scalability issue when dealing with big data problems. Moreover, the performance of EAs critically hinges on the utilized parameter values and operator types, thus it is impossible to design a single EA that can outperform all others in every problem instance. To address these challenges, we propose a heterogeneous framework that integrates a cooperative co-evolution method with various types of memetic algorithms. We use the cooperative co-evolution method to split the big problem into subproblems in order to increase the efficiency of the solving process. The subproblems are then solved using various heterogeneous memetic algorithms. The proposed heterogeneous framework adaptively assigns, for each solution, different operators, parameter values and a local search algorithm to efficiently explore and exploit the search space of the given problem instance. The performance of the proposed algorithm is assessed using the Big Data 2015 competition benchmark problems that contain data with and without noise. Experimental results demonstrate that the proposed algorithm, with the cooperative co-evolution method, performs better than without the cooperative co-evolution method. Furthermore, it obtained very competitive results for all tested instances, if not better, when compared to other algorithms using lower computational times.