loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Stefaan Haspeslagh 1 ; Tommy Messelis 1 ; Greet Vanden Berghe 2 and Patrick De Causmaecker 3

Affiliations: 1 KU Leuven KULAK, Belgium ; 2 KAHO, Belgium ; 3 KU Leuven KULAK and KAHO, Belgium

ISBN: 978-989-8565-39-6

Keyword(s): Nurse Rostering, Satisfiability Problems, Automated Translation, Counting Constraints.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge Representation and Reasoning ; Planning and Scheduling ; Simulation and Modeling ; Symbolic Systems

Abstract: In this paper we present efficient translation schemes for converting nurse rostering problem instances into satisfiability problems (SAT). We define eight generic constraints types allowing the representation of a large number of nurse rostering constraints commonly found in literature. For each of the generic constraint types, we present efficient translation schemes to SAT. Special attention is paid to the representation of counting constraints. We developed a two way translation scheme for counting constraints using O(nlogn) variables and O(n2) clauses. We translated the instances of the First international nurse rostering competition 2010 to SAT and proved the infeasibility of the instances. The SAT translation was used for a hardness study of nurse rostering problem instances based on SAT features.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.204.176.189

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Haspeslagh, S.; Messelis, T.; Vanden Berghe, G. and De Causmaecker, P. (2013). An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems.In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 303-310. DOI: 10.5220/0004259103030310

@conference{icaart13,
author={Stefaan Haspeslagh. and Tommy Messelis. and Greet Vanden Berghe. and Patrick De Causmaecker.},
title={An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2013},
pages={303-310},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004259103030310},
isbn={978-989-8565-39-6},
}

TY - CONF

JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems
SN - 978-989-8565-39-6
AU - Haspeslagh, S.
AU - Messelis, T.
AU - Vanden Berghe, G.
AU - De Causmaecker, P.
PY - 2013
SP - 303
EP - 310
DO - 10.5220/0004259103030310

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.