In this paper, we present a novel meta-heuristic technique for the nurse scheduling problem (NSP). This well-known scheduling problem assigns nurses to shifts per day maximizing the overall quality of the roster while taking various constraints into account. The problem is known to be NP-hard.
Due to its complexity and relevance, many algorithms have been developed to solve practical and often case-specific models of the NSP. The huge variety of constraints and the several objective function possibilities have led to exact and meta-heuristic procedures in various guises, and hence comparison and state-of-the-art reporting of standard results seem to be a utopian idea.
We present a meta-heuristic procedure for the NSP based on the framework proposed by Birbil and Fang (J. Glob. Opt. 25, 263–282, 2003). The Electromagnetic (EM) approach is based on the theory of physics, and simulates attraction and repulsion of sample points in order to move towards a promising solution. Moreover, we present computational experiments on a standard benchmark dataset, and solve problem instances under different assumptions. We show that the proposed procedure performs consistently well under many different circumstances, and hence, can be considered as robust against case-specific constraints.
Electromagnetic meta-heuristic Local search Nurse scheduling
This is a preview of subscription content, log in to check access.
Blau, R., Sear, A.: Nurse scheduling with a micro-computer. J. Ambul. Care Manag. 6, 1–13 (1983)
Burke, E.K., Cowling, P., De Causmacker, P., Vanden Berghe, G.: A memetic approach to the nurse rostering problem. Appl. Intell. 3, 199–214 (2001a)
Burke, E.K., Cowling, P., De Causmacker, P., Vanden Berghe, G.: Fitness evaluation for nurse scheduling problems. In: Proceedings of Congress on Evolutionary Computation, CEC2001, pp. 1139–1146. IEEE Press, Seoul (2001b)
Burke, E.K., De Causmacker, P., Petrovic, S., Vanden Berghe, G.: A multi criteria metaheuristic approach to nurse rostering. In: Proceedings of Congress on Evolutionary Computation, CEC2002, pp. 1197–2002. IEEE Press, Honolulu (2002)
Burke, E.K., De Causmacker, P., Petrovic, S., Vanden Berghe, G.: Variable neighbourhood search for nurse rostering problems. In: Metaheuristics: Computer Decision-Making, pp. 153–172. Kluwer, Norwell (2004a)
Debels, D., De Reyck, B., Leus, R., Vanhoucke, M.: A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur. J. Oper. Res. 169, 638–653 (2006)
Debels, D., Vanhoucke, M.: An electromagnetism meta-heuristic for the resource-constrained project scheduling problem. In: Lecture Notes in Computer Science, vol. 3871, pp. 259–270. Springer, New York (2006)
De Causmaecker, P., Vanden Berghe, G.: Relaxation of coverage constraints in hospital personnel rostering. In: Lecture Notes in Computer Science, vol. 2740, pp. 129–147. Springer, New York (2003)
Li, J., Aickelin, U.: A bayesian optimization algorithm for the nurse scheduling problem. In: Proceedings of 2003 Congress on Evolutionary Computation (CEC2003), pp. 2149–2156. (2003)
Martins, E., Pascoal, M.: A new implementation of Yen’s ranking loopless paths algorithm. Q. J. Belg. Fr. Italian Oper. Res. Soc. 1, 121–134 (2003)
Millar, H., Kiragu, M.: Cyclic and non-cyclic scheduling of 12h shift nurses by network programming. Eur. J. Oper. Res. 104, 582–592 (1998)
Miller, H., Pierskalla, W., Rath, G.: Nurse scheduling using mathematical programming. Oper. Res. 24, 857–870 (1976)
Osogami, T., Imai, H.: Classification of various neighbourhood operations for the nurse scheduling problem. In: Lecture Notes in Computer Science, vol. 1969, pp. 72–83. Springer, New York (2000),
Schrage, L.: LINDO: Optimization Software for Linear Programming. LINDO Systems, Chicago (1995)
Vanhoucke, M., Maenhout, B.: Characterisation and generation of nurse scheduling problem instances. Characterisation and generation of nurse scheduling problem instances. Working paper 05/339, Ghent University (2005)
Warner, M.: Scheduling nursing personnel according to nursing preference: A mathematical approach. Oper. Res. 24, 842–856 (1976)