Cooperating local search for the maximum clique problem

  • Authors:

  • Wayne Pullan;Franco Mascia;Mauro Brunato

  • Affiliations:

  • School of Information and Communication Technology, Griffith University, Gold Coast, Australia;Dipartimento di Ingegneria e Scienza dell'Informazione, Università di Trento, Trento, Italy;Dipartimento di Ingegneria e Scienza dell'Informazione, Università di Trento, Trento, Italy

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The advent of desktop multi-core computers has dramatically improved the usability of parallel algorithms which, in the past, have required specialised hardware. This paper introduces cooperating local search (CLS), a parallelised hyper-heuristic for the maximum clique problem. CLS utilises cooperating low level heuristics which alternate between sequences of iterative improvement, during which suitable vertices are added to the current clique, and plateau search, where vertices of the current clique are swapped with vertices not in the current clique. These low level heuristics differ primarily in their vertex selection techniques and their approach to dealing with plateaus. To improve the performance of CLS, guidance information is passed between low level heuristics directing them to particular areas of the search domain. In addition, CLS dynamically reconfigures the allocation of low level heuristics to cores, based on information obtained during a trial, to ensure that the mix of low level heuristics is appropriate for the instance being optimised. CLS has no problem instance dependent parameters, improves the state-of-the-art performance for the maximum clique problem over all the BHOSLIB benchmark instances and attains unprecedented consistency over the state-of-the-art on the DIMACS benchmark instances.