Achieving super-linear performance in parallel multi-objective evolutionary algorithms by means of cooperative coevolution

  • Authors:

  • Bernabé Dorronsoro;GréGoire Danoy;Antonio J. Nebro;Pascal Bouvry

  • Affiliations:

  • Interdisciplinary Centre for Security, Reliability, and Trust, University of Luxembourg, 6 rue R. Coudenhove-Kalergi, L-1359, Luxembourg;Faculty of Sciences, Technology and Communication, University of Luxembourg, 6 rue R. Coudenhove-Kalergi, L-1359, Luxembourg;E.T.S.I. Informática, University of Málaga, Campus de Teatinos, 29071 Málaga, Spain;Faculty of Sciences, Technology and Communication, University of Luxembourg, 6 rue R. Coudenhove-Kalergi, L-1359, Luxembourg

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

This article introduces three new multi-objective cooperative coevolutionary variants of three state-of-the-art multi-objective evolutionary algorithms, namely, Non-dominated Sorting Genetic Algorithm II (NSGA-II), Strength Pareto Evolutionary Algorithm 2 (SPEA2) and Multi-objective Cellular Genetic Algorithm (MOCell). In such a coevolutionary architecture, the population is split into several subpopulations or islands, each of them being in charge of optimizing a subset of the global solution by using the original multi-objective algorithm. Evaluation of complete solutions is achieved through cooperation, i.e., all subpopulations share a subset of their current partial solutions. Our purpose is to study how the performance of the cooperative coevolutionary multi-objective approaches can be drastically increased with respect to their corresponding original versions. This is specially interesting for solving complex problems involving a large number of variables, since the problem decomposition performed by the model at the island level allows for much faster executions (the number of variables to handle in every island is divided by the number of islands). We conduct a study on a real-world problem related to grid computing, the bi-objective robust scheduling problem of independent tasks. The goal in this problem is to minimize makespan (i.e., the time when the latest machine finishes its assigned tasks) and to maximize the robustness of the schedule (i.e., its tolerance to unexpected changes on the estimated time to complete the tasks). We propose a parallel, multithreaded implementation of the coevolutionary algorithms and we have analyzed the results obtained in terms of both the quality of the Pareto front approximations yielded by the techniques as well as the resulting speedups when running them on a multicore machine.