Andrew, A. (2008) Automatically detecting neighbourhood constraint interactions using comet. In: Proceedings of the CP 2008 Doctoral Programme. University of New South Wales, pp. 7-12.
neighbourhood_constraint.pdf - Submitted Version
Download (72kB) | Preview
The major benet of using events as the basis for our detection system is the clean separation between the neighbourhoods and detector which we can achieve. The detector simply iterates over a set of Neighbourhood objects and checks each for interactions. The acceptance function for the neighbourhood is set to accept any tness. For purposes of detecting an interaction it does not matter whether a move reduces or increases the constraint violations; both indicate that a relationship exists. The simulation is performed in two stages. Starting from a randomly created initial solution a random move from the neighbourhood is chosen, often this will lead to a constraint change and prevent the need for further exploration. For some constraints the chance of randomly selecting a move which would violate it is fairly low and so a more rigourous search is required. If the initial move has not found any interaction then the detector explores every neighbouring state from the current position. If at any stage a change of the constraint violations is detected then the exploration is stopped.
|Item type:||Book Section|
|Keywords:||Comet, local search, neighbourhood constraint interactions , 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:||24 Jan 2012 09:29|
|Last modified:||23 May 2016 17:49|