Generating SAT local-search heuristics using a GP hyper-heuristic framework

Mohamed Bader, R. Poli

Research output: Contribution to conferencePaperpeer-review

114 Downloads (Pure)

Abstract

We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain disposable heuristics which are evolved and used for a specific subset of instances of a problem. We test the heuristics evolved by GP-HH against well-known local-search heuristics on a variety of benchmark SAT problems. Results are very encouraging.
Original languageEnglish
Pages37-49
Number of pages13
Publication statusPublished - Oct 2008
EventEvolution Artificielle, 8th International Conference - Tours, France
Duration: 29 Oct 200831 Oct 2008

Conference

ConferenceEvolution Artificielle, 8th International Conference
Country/TerritoryFrance
CityTours
Period29/10/0831/10/08

Keywords

  • Genetic Programming
  • Hyper-heuristic

Cite this