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

Mohamed Bader; R. Poli

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

Mohamed Bader, R. Poli

School of Computing

Research output: Contribution to conference › Paper › peer-review

252 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 language	English
Pages	37-49
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

Conference	Evolution Artificielle, 8th International Conference
Country/Territory	France
City	Tours
Period	29/10/08 → 31/10/08

Keywords

Genetic Programming
Hyper-heuristic

Access to Document

AE2007.pdfFinal published version, 186 KB

Cite this

@conference{199794037a464db59c5e1b7f05b322b7,

title = "Generating SAT local-search heuristics using a GP hyper-heuristic framework",

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.",

keywords = "Genetic Programming, Hyper-heuristic",

author = "Mohamed Bader and R. Poli",

note = "Funders: EPSRC grant EP/C523377/1. Publisher: Springer.; Evolution Artificielle, 8th International Conference ; Conference date: 29-10-2008 Through 31-10-2008",

year = "2008",

month = oct,

language = "English",

pages = "37--49",

}

TY - CONF

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

AU - Bader, Mohamed

AU - Poli, R.

N1 - Funders: EPSRC grant EP/C523377/1. Publisher: Springer.

PY - 2008/10

Y1 - 2008/10

N2 - 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.

AB - 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.

KW - Genetic Programming

KW - Hyper-heuristic

M3 - Paper

SP - 37

EP - 49

T2 - Evolution Artificielle, 8th International Conference

Y2 - 29 October 2008 through 31 October 2008

ER -

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

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this