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

Authors:
Mohamed Bader-El-Den;Riccardo Poli
Affiliations:
Department of Computing and Electronic Systems, University of Essex, UK;Department of Computing and Electronic Systems, University of Essex, UK
Venue:
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Year:
2007

Citing 14
Cited 18

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An adaptive evolutionary algorithm for the satisfiability problem

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
A machine program for theorem-proving

Communications of the ACM
Local search characteristics of incomplete SAT procedures

Artificial Intelligence
Foundations of genetic programming

Foundations of genetic programming
Evolutionary algorithms for the satisfiability problem

Evolutionary Computation
Automated discovery of composite SAT variable-selection heuristics

Eighteenth national conference on Artificial intelligence
Learning evaluation functions to improve optimization by local search

The Journal of Machine Learning Research
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
Case-based heuristic selection for timetabling problems

Journal of Scheduling
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Domain-independent extensions to GSAT: solving large structured satisfiability problems

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Evolving bin packing heuristics with genetic programming

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature

Evolving heuristics with genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists

EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Stable solving of CVRPs using hyperheuristics

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evolving human-competitive reusable 2D strip packing heuristics

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Massively parallel evolution of SAT heuristics

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Grammar-based genetic programming for timetabling

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Inc*: an incremental approach for improving local search heuristics

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Incremental evolution of local search heuristics

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Autonomous operator management for evolutionary algorithms

Journal of Heuristics
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic

Journal of Heuristics
Generating meta-heuristic optimization code using ADATE

Journal of Heuristics
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics

IEEE Transactions on Evolutionary Computation
Automated heuristic design

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Genetic programming for auction based scheduling

EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems

Fundamenta Informaticae - Emergent Computing
GARF: towards self-optimised random forests

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part II
Generation of VNS components with grammatical evolution for vehicle routing

EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
A stochastic hyperheuristic for unsupervised matching of partial information

Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain "disposable" heuristicswhich 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 veryencouraging.