An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality

Mohamed Siala
Emmanuel Hébrard
Marie-José Huguet

Abstract

The ATMOSTSEQCARD constraint is the conjunction of a cardinality constraint on a sequence of n variables and of n - q + 1 constraints ATMOST u on each subsequence of size q. This constraint is useful in car-sequencing and crew-rostering problems. In [18], two algorithms designed for the AMONGSEQ constraint were adapted to this constraint with a O(2^q n) and O(n^3) worst case time complexity, respectively. In [10], another algorithm with a O(n2 log n) worst case time complexity and similarly adaptable to filter ATMOSTSEQCARD in O(n log n) was proposed. In this paper, we introduce an algorithm for achieving Arc Consistency on the ATMOSTSEQCARD constraint with a O(n) (hence optimal) worst case time complexity. We then empirically study the efficiency of our propagator on instances of the car-sequencing and crew-rostering problems.
Fichier principal
Vignette du fichier
paper.pdf (277.58 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00713860 , version 1 (02-07-2012)

Identifiers

Cite

Mohamed Siala, Emmanuel Hébrard, Marie-José Huguet. An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality. Eighteenth International Conference on Principles and Practice of Constraint Programming, Oct 2012, Quebec, Canada. pp.55-69, ⟨10.1007/978-3-642-33558-7_7⟩. ⟨hal-00713860⟩
165 View
242 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More