Solution neighbourhoods for constraint-directed local search

Authors:
Jun He;Pierre Flener;Justin Pearson
Affiliations:
Uppsala University, Uppsala, Sweden;Uppsala University, Uppsala, Sweden;Uppsala University, Uppsala, Sweden
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 4
Cited 0

Constraint-Based Local Search

Constraint-Based Local Search
Revisiting constraint-directed search

Information and Computation
On matrices, automata, and double counting

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An automaton Constraint for Local Search

Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose solution neighbourhoods, which contain only solutions to a chosen constraint, as the solutions to a constraint capture the structure of the constraint. We save the time needed for neighbourhood evaluation of that constraint by using a solution neighbourhood. This may be useful especially for constraints for which there exists no known constant-time algorithm for neighbour evaluation. We design a solution neighbourhood for the very useful automaton constraint, and demonstrate the practicality of our approach on a library of nurse scheduling instances. We show the feasibility of designing solution neighbourhoods for other constraints.