Automatically detecting neighbourhood constraint interactions using Comet

A. Andrew, J. Levine, Y. Naveh (Editor), P. Flener (Editor)

Research output: Contribution to conferencePaper

67 Downloads (Pure)

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.
Original languageEnglish
Pages7-12
Number of pages6
Publication statusPublished - 1 Sep 2008
Event5th International Workshop on Local Search Techniques in Constraint Satisfaction - Sydney, Australia
Duration: 15 Sep 2008 → …

Conference

Conference5th International Workshop on Local Search Techniques in Constraint Satisfaction
CountryAustralia
CitySydney
Period15/09/08 → …

    Fingerprint

Keywords

  • Comet
  • neighbourhood constraint interactions
  • local search
  • constraint satisfaction

Cite this

Andrew, A., Levine, J., Naveh, Y. (Ed.), & Flener, P. (Ed.) (2008). Automatically detecting neighbourhood constraint interactions using Comet. 7-12. Paper presented at 5th International Workshop on Local Search Techniques in Constraint Satisfaction, Sydney, Australia.