Automatically detecting neighbourhood constraint interactions using Comet

Andrew, A. and Levine, J.; Naveh, Y. and Flener, P., eds. (2008) Automatically detecting neighbourhood constraint interactions using Comet. In: 5th International Workshop on Local Search Techniques in Constraint Satisfaction, 2008-09-15. (http://www.cis.strath.ac.uk/cis/research/publicati...)

[thumbnail of neighbourhood_constraint.pdf]
Preview
 PDF. Filename: neighbourhood_constraint.pdf
Accepted Author Manuscript
Download (72kB)| Preview

Abstract

Local Search has been shown to be capable of producing high quality solutions in a variety of hard constraint and optimisation problems. Typically implementing a Local Search algorithm is done in a problem specic manner. In the last few years a variety of approaches have emerged focussed on easing the implementation and creating a clean separation between the algorithm and problem. We present a system which can deduce information about the interactions between problem constraints and the search neighbourhoods whilst maintaining a loose coupling between these components. We apply this technique to the International Timetabling Competition instances and show an implementation expressed in Comet.

ORCID iDs

Andrew, A. and Levine, J. ORCID logoORCID: https://orcid.org/0000-0001-7016-2978; Naveh, Y. and Flener, P.
CORE (COnnecting REpositories)