A gender-based genetic algorithm for the automatic configuration of algorithms

  • Authors:
  • Carlos Ansótegui;Meinolf Sellmann;Kevin Tierney

  • Affiliations:
  • Universitat de Lleida, Spain;Brown University, Department of Computer Science, Providence, RI;Brown University, Department of Computer Science, Providence, RI

  • Venue:
  • CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A problem that is inherent to the development and efficient use of solvers is that of tuning parameters. The CP community has a long history of addressing this task automatically. We propose a robust, inherently parallel genetic algorithm for the problem of configuring solvers automatically. In order to cope with the high costs of evaluating the fitness of individuals, we introduce a gender separation whereby we apply different selection pressure on both genders. Experimental results on a selection of SAT solvers show significant performance and robustness gains over the current state-of-the-art in automatic algorithm configuration.