A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning

  • Authors:

  • A. J. Soper;C. Walshaw;M. Cross

  • Affiliations:

  • School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Greenwich, London, UK (e-mail: a.j.soper@gre.ac.uk.);School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Greenwich, London, UK (e-mail: c.walshaw@gre.ac.uk.);School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Greenwich, London, UK

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The graph-partitioning problem is to divide a graph into several pieces so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges is minimised. Important applications of the problem arise, for example, in parallel processing where data sets need to be distributed across the memory of a parallel machine. Very effective heuristic algorithms have been developed for this problem which run in real-time, but it is not known how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. A distinctive feature is the use of a multilevel heuristic algorithm to provide an effective crossover. The technique is tested on several example graphs and it is demonstrated that our method can achieve extremely high quality partitions significantly better than those found by the state-of-the-art graph-partitioning packages.