Andrew, A. and Levine, J. (2008) Automatically detecting neighbourhood constraint interactions using Comet. In: 5th International Workshop on Local Search Techniques in Constraint Satisfaction, 2008-09-15, Sydney.
neighbourhood_constraint.pdf - Submitted Version
Download (72kB) | Preview
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.
|Item type:||Conference or Workshop Item (Paper)|
|Keywords:||Comet, neighbourhood constraint interactions, local search, constraint satisfaction, Electronic computers. Computer science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||27 Jan 2012 09:52|
|Last modified:||27 Mar 2015 07:01|
Actions (login required)