Abstract
We present one general high-level hyper-heuristic approach for addressing two timetabling problems in the health care domain: the patient admission scheduling problem and the nurse rostering problem. The complex combinatorial problem of patient admission scheduling has only recently been introduced to the research community. In addition to the instance that was introduced on this occasion, we present a new set of benchmark instances. Nurse rostering, on the other hand, is a well studied operations research problem in health care. Over the last years, a number of problem definitions and their corresponding benchmark instances have been introduced. Recently, a new nurse rostering problem description and datasets were introduced during the first Nurse Rostering Competition. In the present paper, we focus on this nurse rostering problem description.
The main contribution of the paper constitutes the introduction of a general hyper-heuristic approach, which is suitable for addressing two rather different timetabling problems in health care. It is applicable without much effort, provided a set of low-level heuristics is available for each problem. We consider the instances of both health care problems for testing the general applicability of the hyper-heuristic approach. Also, improvements to the previous best results for the patient admission scheduling problem are presented. Solutions to the new nurse rostering instances are presented and compared with results obtained by an integer linear programming approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ayob, M., Kendall, G.: A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In: The International Conference on Intelligent Technologies, InTech’03 (2003)
Bilgin, B., Özcan, E., Korkmaz, E.E.: An experimental study on hyper-heuristics and exam timetabling. In: Burke, E.K., Rudová, H. (eds.) Revised Selected Papers of 6th International Conference on Practice and Theory of Automated Timetabling VI (Patat 2006). LNCS, vol. 3867, pp. 394–412. Springer, Berlin (2007)
Bilgin, B., De Causmaecker, P., Vanden Berghe, G.: A hyperheuristic approach to belgian nurse rostering problems. In: Proceedings of the 4th Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 693–695 (2009)
Brucker, P., Burke, E.K., Curtois, T., Qu, R., Vanden Berghe, G.: A shift sequence based approach for nurse scheduling and a new benchmark dataset. J. Heuristics 16(4), 559–573 (2010)
Burke, E.K., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Handbook of Metaheuristics, pp. 457–474. Springer, New York (2003)
Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics 9(6), 451–470 (2003)
Burke, E.K., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7(6), 441–499 (2004)
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 449–468. Springer, Berlin (2010)
Burke, E.K., Curtois, T., Qu, R., Vanden Berghe, G.: A scatter search approach to the nurse rostering problem. J. Oper. Res. Soc. 61, 1667–1679 (2010)
Chien, C.-F., Tseng, F.-P., Chen, C.-H.: An evolutionary approach to rehabilitation patient scheduling: A case study. Eur. J. Oper. Res. 189, 1234–1253 (2008)
Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E.K., Erben, W. (eds.) Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling. LNCS, vol. 2079, pp. 176–190. Springer, Berlin (2001)
De Causmaecker, P., Vanden Berghe, G.: A categorisation of nurse rostering problems. J. Sched. 14(1), 3–16 (2011)
Demeester, P., Bilgin, B., Vanden Berghe, G.: Patient admission scheduling benchmark instances. http://allserv.kahosl.be/~peter/pas/index.html (2008)
Demeester, P., Souffriau, W., De Causmaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for automatically assigning patients to beds. Artif. Intell. Med. 48(1), 61–70 (2010)
Dowsland, K.A., Soubeiga, E., Burke, E.K.: A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. Eur. J. Oper. Res. 179(3), 759–774 (2007)
Dueck, G.: New optimisation heuristics. the great deluge algorithm and record-to-record travel. J. Comput. Phys. 104, 86–92 (1993)
Gemmel, P., Van Dierdonck, R.: Admission scheduling in acute care hospitals: does the practice fit with the theory? Int. J. Oper. Prod. Manag. 19(9), 863–878 (1999)
Hans, E.W., Wullink, G., van Houdenhoven, M., Kazemier, G.: Robust surgery loading. Eur. J. Oper. Res. 185, 1038–1050 (2008)
Haspeslagh, S., De Causmaecker, P., Stølevik, M., Schaerf, A.: First international nurse rostering competition 2010. Technical report, K.U. Leuven, CODeS (May 2010)
Hutzschenreuter, A.K., Bosman, P.A.N., Blonk-Altena, I., van Aarle, J., La Poutré, J.A.: Agent-based patient admission scheduling in hospitals. In: Mueller, J.P., Padgham, L., Parkes, D.C., Parsons, S. (eds.) Proceedings of the Seventh International Conference on Autonomous Agents and Multiagent Systems—AAMAS-2008, pp. 45–54. ACM, New York (2008)
Kendall, G., Mohamad, M.: Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proc. of the 2004 IEEE International Conference on Network (ICON2004) (2004)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Sci. New Ser. 220(4598), 671–680 (1983)
Marinagi, C.C., Spyropoulos, C.D., Papatheodorou, C., Kokkotos, S.: Continual planning and scheduling for managing patient tests in hospital laboratories. Artif. Intell. Med. 20, 139–154 (2000)
Misir, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), Barcelona, Spain, July 18–23 (2010)
Ogulata, S.N., Erol, R.: A hierarchical multiple criteria mathematical programming approach for scheduling general surgery operations in large hospitals. J. Med. Syst. 27(3), 259–270 (2003)
Özcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3–23 (2008)
Smith-Daniels, V.L., Schweikhart, S.B., Smith-Daniels, D.E.: Capacity management in health care services: Review and future research directions. Decis. Sci. 19(4), 889–919 (1988)
Soubeiga, E.: Development and application of hyperheuristics to personnel scheduling. Ph.D. thesis, University of Nottingham (2003)
Vermeulen, I.B., Bohte, S.M., Somefun, D.J.A., La Poutré, J.A.: Multi-agent Pareto appointment exchanging in hospital patient scheduling. Serv. Oriented Comput. Appl. 1(3), 185–196 (2007)
Vermeulen, I.B., Bohte, S.M., Elkhuizen, S.G., Bakker, P.J.M., La Poutré, J.A.: Decentralized online scheduling of combination-appointments in hospitals. In: Proc. of the International Conference on Automated Planning and Scheduling. ACM, New York (2008)
Vermeulen, I.B., Bohte, S.M., Elkhuizen, S.G., Lameris, H., Bakker, P.J.M., La Poutré, J.A.: Adaptive resource allocation for efficient patient scheduling. Artif. Intell. Med. 46, 67–80 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bilgin, B., Demeester, P., Misir, M. et al. One hyper-heuristic approach to two timetabling problems in health care. J Heuristics 18, 401–434 (2012). https://doi.org/10.1007/s10732-011-9192-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-011-9192-0