Homogeneous and heterogeneous island models for the set cover problem

  • Authors:
  • Andrea Mambrini;Dirk Sudholt;Xin Yao

  • Affiliations:
  • University of Birmingham, Birmingham, UK;University of Sheffield, Sheffield, UK;University of Birmingham, Birmingham, UK

  • Venue:
  • PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose and analyse two island models that provably find good approximations for the SetCover problem. A homogeneous island model running parallel instances of the SEMO algorithm--following Friedrich et al. (Evolutionary Computation 18(4), 2010, 617-633)--leads to significant speedups over a single SEMO instance, but at the expense of large communication costs. A heterogeneous island model, where each island optimises a different single-objective fitness function, provides similar speedups at reduced communication costs. We compare different topologies for the homogeneous model and different migration policies for the heterogeneous one.