Generic Incremental Algorithms for Local Search

DMCA

Generic Incremental Algorithms for Local Search

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Pierre Flener , Justin Pearson

Citations:

5 - 2 self

BibTeX

@MISC{Flener_genericincremental,
    author = {Pierre Flener and Justin Pearson},
    title = {Generic Incremental Algorithms for Local Search},
    year = {}
}

OpenURL

Abstract

Abstract. When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for maintaining these measures must be implemented. These are complicated and time-consuming tasks, which clearly reduces the productivity of the local-search practitioner. We introduce a generic scheme that, from a description of a constraint in monadic existential second-order logic extended with counting, automatically gives penalty and variable-conflict measures for such a constraint, as well as incremental algorithms for maintaining these measures. We prove that our variable-conflict measure for a variable x is lower-bounded by the maximum penalty decrease that may be achieved by only changing the value of x, as well as upper bounded by the penalty measure. Without these properties, the local search performance may degrade. We also demonstrate the usefulness of the approach by replacing a built-in global constraint by a modelled version, while still obtaining competitive results in terms of runtime and robustness. This is especially attractive when a particular (global) constraint is not built in. 1

Keyphrases

local search generic incremental algorithm variable-conflict measure incremental algorithm penalty measure built-in global constraint generic scheme competitive result time-consuming task monadic existential second-order logic local-search practitioner local search performance maximum penalty decrease variable conflict modelled version

DMCA