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.
|Number of pages||13|
|Publication status||Published - Oct 2008|
|Event||Evolution Artificielle, 8th International Conference - Tours, France|
Duration: 29 Oct 2008 → 31 Oct 2008
|Conference||Evolution Artificielle, 8th International Conference|
|Period||29/10/08 → 31/10/08|
- Genetic Programming