Integer programming techniques for the nurse rostering problem

This work presents integer programming techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are propos...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 239; no. 1; pp. 225 - 251
Main Authors Santos, Haroldo G., Toffolo, Túlio A. M., Gomes, Rafael A. M., Ribas, Sabir
Format Journal Article
LanguageEnglish
Published New York Springer US 01.04.2016
Springer
Springer Nature B.V
Subjects
Algorithms
Business and Management
Combinatorics
Competition
Computation
Computer science
Experiments
Heuristic
Integer programming
Management
Nurses
Operations research
Operations Research/Decision Theory
Optimization
Optimization techniques
Solvers
Strategy
Studies
Theory of Computation
Work hours
Workforce planning
Integer programming
Nurse rostering
Cutting planes
MIP heuristics
Online AccessGet full text

Cover

More Information
Summary:This work presents integer programming techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are proposed and evaluated. A large number of computational experiments with these techniques produced the following results: the optimality of the vast majority of instances was proved, the best known solutions were improved by up to 15 % and strong dual bounds were obtained. In the spirit of reproducible science, all code was implemented using the Computational Infrastructure for Operations Research.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-014-1594-6