Abstract
This paper describes an approach in which a local search technique is alternated with a process which ‘jumps’ to another point in the search space. After each ‘jump’ a (time-intensive) local search is used to obtain a new local optimum. The focus of the paper is in monitoring the progress of this technique on a set of real world nurse rostering problems. We propose a model for estimating the quality of this new local optimum. We can then decide whether to end the local search based on the predicted quality. The fact that we avoid searching these bad neighbourhoods enables us to reach better solutions in the same amount of time. We evaluate the approach on five highly constrained problems in nurse rostering. These problems represent complex and challenging real world rostering situations and the approach described here has been developed during a commercial implementation project by ORTEC bv.
This is a preview of subscription content, log in via an institution to check access.
Notes
In the cases we studied T defined in this way is ample. This is in agreement with our idea that the progress control should be optimistic.
References
Abdennadher S and Schlenker H (1999). Nurse scheduling using constraint logic programming. In: Proceedings of the Eleventh Conference on Innovative Applications of Artificial Intelligence. AAAI Press: Menlo Park, CA, pp 838–843.
Aickelin U and Li J (2007). An estimation of distribution algorithm for nurse scheduling. Ann Opns Res 155: 289–309.
Aickelin U and Dowsland KA (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J Sched 3: 139–153.
Aickelin U and Dowsland KA (2003). An indirect genetic algorithm for a nurse scheduling problem. Comput Opns Res 31: 761–778.
Bard JF and Purnomo HW (2005a). A column generation-based approach to solve the preference scheduling problem for nurses with downgrading. Socio Econ Plan Sci 39: 193–213.
Bard JF and Purnomo HW (2005b). Preference scheduling for nurses using column generation. Eur J Opl Res 164: 510–534.
Bard JF and Purnomo HW (2007). Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J Sched 10: 5–23.
Beddoe GR (2004). Case-based reasoning in personnel rostering. PhD thesis, University of Nottingham, UK.
Beddoe GR and Petrovic S (2006). Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. Eur J Opl Res 175: 649–671.
Beddoe GR and Petrovic S (2007). Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. J Opl Res Soc 58: 1586–1598.
Bellanti F, Carello G, Della Croce F and Tadei R (2004). A greedy-based neighborhood search approach to a nurse rostering problem. Eur J Opl Res 153: 2840.
Burke EK and Soubeiga E (2003). Scheduling nurses using a tabu-search hyper-heuristic. In: Kendall G et al (eds). 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2003). University of Nottingham, UK, pp 197–218.
Burke EK, De Causmaecker P and vanden Berghe G (1999). A hybrid tabu search algorithm for the nurse rostering problem. In: McKay B, Yao X, Newton CS, Kim J and Furuhashi T (eds) Simulated Evolution and Learning, Selected Papers from the 2nd Asia-Pacific Conference on Simulated Evolution and Learning, SEAL 98. Lecture Notes in Artificial Intelligence, Vol. 1585, Springer: London, pp 187–194.
Burke EK, De Causmaecker P, Petrovic S and vanden Berghe G (2001a). Variable neighbourhood search for nurse rostering problems. In: Sousa JD (ed). Proceedings of the 4th Metaheuristics Internation Conference (MIC 2001). Porto, Portugal, pp 755–760.
Burke EK, Cowling P, De Causmaecker P and vanden Berghe G (2001b). A memetic approach to the nurse rostering problem. Appl Intell 15: 199–214.
Burke EK, Kendall G and Soubeiga E (2003). A tabu-search hyper-heuristic for timetabling and rostering. J Heuristics 9: 451–470.
Burke EK, De Causmaecker P, vanden Berghe G and Van Landeghem H (2004). The state of the art of nurse rostering. J Sched 7: 441–499.
Burke EK, Curtois T, Qu R and vanden Berge G (2007). A time predefined variable depth search for nurse rostering. Technical Report, School of Computer Science and IT, University of Nottingham. http://www.cs.nott.ac.uk/TR/2007/2007-6.pdf.
Burke EK, Curtois T, Post G, Qu R and Veltman B (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur J Opl Res 188: 330–341.
Cai X and Li KN (2000). A genetic algorithm for scheduling staff of mixed skills under multi-criteria. Eur J Opl Res 125: 359–369.
Cheng BMW, Lee JHM and Wu JCK (1997). A nurse rostering system using constraint programming and redundant modeling. IEEE T Inf Technol B 1 (1): 44–54.
Chun AHW, Chan SHC, Lam GPS, Tsang FMF, Wong J and Yeung DWM (2000). Nurse rostering at the hospital authority of Hong Kong. In: Proceedings of the Twelfth Conference on Innovative Applications of Artificial Intelligence. AAAI Press/The MIT Press: Menlo Park, CA, pp 951–956.
Curtois T (2008). Nurse rostering benchmark data sets. http://www.cs.nott.ac.uk/~tec/NRP/.
Darmoni SJ, Fajner A, Mah N, Leforestier A, Von-dracek M, Stelian O and Baldenweck M (1995). HOROPLAN: Computer-assisted nurse scheduling using constraint-based programming. J Soc Health Syst 5: 41–54.
Dias TM, Ferber DF, de Souza CC and Moura AV (2003). Constructing nurse schedules at large hospitals. Int T Opl Res 10: 245–265.
Dowsland KA (1998). Nurse scheduling with tabu search and strategic oscillation. Eur J Opl Res 106: 393–407.
Ernst AT, Jiang H, Krishnamoorthy M, Owens B and Sier D (2004). An annotated bibliography of personnel scheduling and rostering. Ann Opns Res 127: 21–44.
Eveborn P and Rönnqvist M (2004). Scheduler—a system for staff planning. Ann Opns Res 128: 21–45.
Glover FW and Kochenberger GA (eds). (2003). Handbook of Metaheuristics. Kluwer Academic Publishers: Boston, MA.
Ikegami A and Niwa A (2003). A subproblem-centric model and approach to the nurse scheduling problem. Math Program 97: 517–541.
Jan A, Yamamoto M and Ohuchi A (2000). Evolutionary algorithms for nurse scheduling problem. In: Proceedings of the 2000 Congress on Evolutionary Computation. IEEE Press: California, USA, pp 196–203.
Jaumard B, Semet F and Vovor T (1998). A generalized linear programming model for nurse scheduling. Eur J Opl Res 107: 1–18.
Lau HC (1996). On the complexity of manpower shift scheduling. Comput Opns Res 23: 93–102.
Loureno HR, Martin OC and Stützle T (2003). Iterated local search. In: Glover F and Kochenberger G (eds). Handbook of Metaheuristics. Kluwer: Boston, MA, pp 321–353.
Mason AJ and Smith MC (1998). A nested column generator for solving rostering problems with integer programming. In: Caccetta L, Teo KL, Siew PF, Leung YH, Jennings LS and Rehbock V (eds). International Conference on Optimisation: Techniques and Applications. Perth, Australia, pp 827–834.
Meisels A, Gudes E and Solotorevsky G (1997). Combining rules and constraints for employee timetabling. Int J Intell Syst 12: 419–439.
Meyer auf'm Hofe H (2000). Solving rostering tasks as constraint optimization. In: Burke EK and Erben W (eds). Selected Papers from the Third International Conference on Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 2079. Springer: Berlin, pp 191–212.
Millar HH and Kiragu M (1998). Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. Eur J Opl Res 104: 582–592.
Özcan E (2005). Memetic algorithms for nurse rostering. In: Yolum P et al (eds). The 20th International Symposium on Computer and Information Sciences. Springer-Verlag: Berlin, pp 482–492.
Paquete L and Stützle T (2002). An experimental investigation of iterated local search for coloring graphs. In: Cagnoni S et al (eds). Proceedings of the Applications of Evolutionary Computing on EvoWorkshops. Springer-Verlag: London, UK, pp 122–131.
Schaerf A and Meisels A (1999). Solving employee timetabling problems by generalized local search. In: Lamma E and Mello P (eds). Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence. Springer-Verlag: Berlin, pp 380–389.
Stützle T (1998). Applying iterated local search to the permutation flow shop problem. Technical report, Technische Hochschule Darmstadt.
Stützle T (2006). Iterated local search for the quadratic assignment problem. Eur J Opl Res 174: 1519–1539.
Tanomaru J (1995). Staff scheduling by a genetic algorithm with heuristic operators. In: Proceedings of the IEEE Conference on Evolutionary Computation. pp 456–461.
Thornton J and Sattar A (1997). Nurse rostering and integer programming revisited. In: Verma B and Yao X (eds). International Conference on Computational Intelligence and Multimedia Applications. Griffith University: Gold Coast, Australia, pp 49–58.
Vanden Berghe G (2002). An advanced model and novel meta-heuristic solution methods to personnel scheduling in healthcare. PhD thesis, University of Gent, Belgium.
Voss S, Martello S, Osman IH and Roucairol C (eds). (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers: Boston, MA.
Warner DM (1976). Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Opns Res 24: 842–856.
Weil G, Heus K, Francois P and Poujade M (1995). Constraint programming for nurse scheduling. IEEE Eng Med Biol 14: 417–422.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Burke, E., Curtois, T., van Draat, L. et al. Progress control in iterated local search for nurse rostering. J Oper Res Soc 62, 360–367 (2011). https://doi.org/10.1057/jors.2010.86
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2010.86