Soft-regular with a Prefix-size Violation Measure

Khong, Minh Thanh;Lecoutre, Christophe;Schaus, Pierre;Deville, Yves
(2018) 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research — Location: Delft, The Netherlands (26.June.2018)

Files

paper-final.pdf
  • Open Access
  • Adobe PDF
  • 288.64 KB
Download

Details

Authors
Abstract
In this paper, we propose a variant of the global constraint soft-regular by introducing a new violation measure that relates a cost variable to the size of the longest prefix of the assigned variables, which is consistent with the constraint automaton. This measure allows us to guarantee that first decisions (assigned variables) respect the rules im- posed by the automaton. We present a simple algorithm, based on a Multi-valued Decision Diagram (MDD), that enforces Generalized Arc Consistency (GAC). We provide an illustrative case study on nurse rostering, which shows the practical interest of our approach.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Khong, M. T., Lecoutre, C., Schaus, P., & Deville, Y. (2018). Soft-regular with a Prefix-size Violation Measure. Soft-regular with a Prefix-size Violation Measure. Accepted/in-press. 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Delft, The Netherlands. https://hdl.handle.net/2078.5/172982 (Original work published 2018)