The Regularization of CSPs for Rostering, Planning and Resource Management Problems - Artificial Intelligence Applications and Innovations (AIAI 2018) Access content directly
Conference Papers Year : 2018

The Regularization of CSPs for Rostering, Planning and Resource Management Problems

Abstract

This paper presents a new approach to solve rostering, planning and resource management problems. This is achieved by transforming several kinds of finite domain constraints of a given constraint satisfaction problem (CSP) into a set of regular membership constraints; and then these regular membership constraints are combined together to a more specific regular membership constraint. The purpose of this approach is to improve the speed of CSPs resolution and to remove undesirable redundant constraints (constraints which slow down the resolution speed) by replacing part of or all constraints of a CSP with a set of regular membership constraints followed by the combination of multiple regular membership constraints into a new, more precise regular membership constraint. A concise rostering example has demonstrated that our approach enables a significant improvement of the performance of the CSP resolution due to the pruning of the search tree.
Fichier principal
Vignette du fichier
467708_1_En_18_Chapter.pdf (440.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01821029 , version 1 (22-06-2018)

Licence

Attribution

Identifiers

Cite

Sven Löffler, Ke Liu, Petra Hofstedt. The Regularization of CSPs for Rostering, Planning and Resource Management Problems. 14th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), May 2018, Rhodes, Greece. pp.209-218, ⟨10.1007/978-3-319-92007-8_18⟩. ⟨hal-01821029⟩
100 View
40 Download

Altmetric

Share

Gmail Facebook X LinkedIn More