A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction

Ademir Aparecido Constantino, Everton Tozzo, Rodrigo Lankaites Pinheiro, Dario Landa-Silva, Wesley Romão

2015

Abstract

The nurse scheduling problem (NSP) is a combinatorial optimisation problem widely tackled in the literature. Recently, a new variant of this problem was proposed, called nurse scheduling problem with balanced preference satisfaction (NSPBPS). This paper further investigates this variant of the NSP as we propose a new algorithm to solve the problem and obtain a better balance of overall preference satisfaction. Initiall, the algorithm converts the problem to a bottleneck assignment problem and solves it to generate an initial feasible solution for the NSPBPS. Posteriorly, the algorithm applies the Variable Neighbourhood Search (VNS) metaheuristic using two sets of search neighbourhoods in order to improve the initial solution. We empirically assess the performance of the algorithm using the NSPLib benchmark instances and we compare our results to other results found in the literature. The proposed VNS algorithm exhibits good performance by achieving solutions that are fairer (in terms of preference satisfaction) for the majority of the scenarios.

Download


Paper Citation


in Harvard Style

Aparecido Constantino A., Tozzo E., Lankaites Pinheiro R., Landa-Silva D. and Romão W. (2015). A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction . In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-096-3, pages 462-470. DOI: 10.5220/0005364404620470

in Bibtex Style

@conference{iceis15,
author={Ademir Aparecido Constantino and Everton Tozzo and Rodrigo Lankaites Pinheiro and Dario Landa-Silva and Wesley Romão},
title={A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2015},
pages={462-470},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005364404620470},
isbn={978-989-758-096-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction
SN - 978-989-758-096-3
AU - Aparecido Constantino A.
AU - Tozzo E.
AU - Lankaites Pinheiro R.
AU - Landa-Silva D.
AU - Romão W.
PY - 2015
SP - 462
EP - 470
DO - 10.5220/0005364404620470