Back to search

University of Waterloo

Efficient Propagators for Global Constraints

Abstract

dc:description.abstract

We study in this thesis three well known global constraints. The All-Different constraint restricts a set of variables to be assigned to distinct values. The <em>global cardinality constraint</em> (GCC) ensures that a value <em>v</em> is assigned to at least <em>l<sub>v</sub></em> variables and to at most <em>u<sub>v</sub></em> variables among a set of given variables where <em>l<sub>v</sub></em> and <em>u<sub>v</sub></em> are non-negative integers such that <em>l<sub>v</sub></em> &le; <em>u<sub>v</sub></em>. The Inter-Distance constraint ensures that all variables, among a set of variables <em>x</em><sub>1</sub>, . . . , <em>x<sub>n</sub></em>, are pairwise distant from <em>p</em>, i. e. |<em>x<sub>i</sub></em> - <em>x<sub>j</sub></em>| &ge; <em>p</em> for all <em>i</em> &ne; <em>j</em>. The All-Different constraint, the GCC, and the Inter-Distance constraint are largely used in scheduling problems. For instance, in scheduling problems where tasks with unit processing time compete for a single resource, we have an All-Different constraint on the starting time variables. When there are <em>k</em> resources, we have a GCC with <em>l<sub>v</sub></em> = 0 and <em>u<sub>v</sub></em> = <em>k</em> over all starting time variables. Finally, if tasks have processing time <em>t</em> and compete for a single resource, we have an Inter-Distance constraint with <em>p</em> = <em>t</em> over all starting time variables. We present new propagators for the All-Different constraint, the GCC, and the Inter-Distance constraint i. e. , new filtering algorithms that reduce the search space according to these constraints. For a given consistency, our propagators outperform previous propagators both in practice and in theory. The gains in performance are achieved through judicious use of advanced data structures combined with novel results on the structural properties of the constraints.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2006

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Quimper, Claude-Guy

Subjects

dc:subject × 8

Rights

dc:rights
Statement dc:rights
  • Copyright: 2006, Quimper, Claude-Guy. All rights reserved.
Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/2916

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Quimper, Claude-Guy. Efficient Propagators for Global Constraints. University of Waterloo, 2006. http://hdl.handle.net/10012/2916