DMCA
On constraint-oriented neighbours for local search (2007)
| Venue: | Department of Information Technology, Uppsala University, Box |
| Citations: | 1 - 0 self |
BibTeX
@TECHREPORT{Flener07onconstraint-oriented,
author = {Pierre Flener and Justin Pearson},
title = {On constraint-oriented neighbours for local search},
institution = {Department of Information Technology, Uppsala University, Box},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. In the context of local search, we investigate the exploration of constraint-oriented neighbourhoods, where a set of constraints is picked before considering the neighbouring configurations where those constraints may have a different penalty. Given the semantics of a constraint, neighbourhoods consisting only of configurations with decreased (or preserved, or increased) penalty can be represented intensionally as a new attribute for constraint objects. We present a framework for combining neighbourhoods that allows different local search heuristics to be expressed, including multi-phase heuristics where an automatically identifiable suitable subset of the constraints is satisfied upon a first phase and then preserved in a second phase. This simplifies the design of local search algorithms compared to using just a variable-oriented neighbourhood, while not incurring any runtime overhead. 1
Keyphrases
local search constraint-oriented neighbour variable-oriented neighbourhood constraint-oriented neighbourhood runtime overhead different penalty identifiable suitable subset first phase second phase different local search heuristic neighbouring configuration local search algorithm constraint object multi-phase heuristic new attribute
