A framework for constraint based local search using ESSENCE

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Structured Neighbourhood Search (SNS) is a framework for constraint-based local search for problems expressed in the ESSENCE abstract constraint specification language. The local search explores a structured neighbourhood, where each state in the neighbourhood preserves a high level structural feature of the problem. SNS derives highly structured problem-specific neighbourhoods automatically and directly from the features of the ESSENCE specification of the problem. Hence, neighbourhoods can represent important structural features of the problem, such as partitions of sets, even if that structure is obscured in the low-level input format required by a constraint solver. SNS expresses each neighbourhood as a constrained optimisation problem, which is solved with a constraint solver. We have implemented SNS, together with automatic generation of neighbourhoods for high level structures, and report high quality results for several optimisation problems.

Cite

CITATION STYLE

APA

Akgün, O., Attieh, S., Gent, I. P., Jefferson, C., Miguel, I., Nightingale, P., … Wetter, J. (2018). A framework for constraint based local search using ESSENCE. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2018-July, pp. 1242–1248). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2018/173

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free