Abstract
This paper considers patient admissions and patient-to-room assignment problems, which are attracting increasing attention. These problems are challenging and concern with the assignment of a set of patients to a set of rooms in a well-defined planning horizon by satisfying several constraints. Hospitals usually face this complex problem of planning admissions and assigning patients to rooms manually, requiring long staff time and high costs. The aim of this paper is to model and solve this problem efficiently. The proposed optimization model is embedded in a matheuristic, which is tested to solve a set of benchmark instances characterized by real-world features. The experimental results show that the solution approach is effective and allows to obtain optimal/sub-optimal solutions in short computational times.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The instances are available at https://bitbucket.org/satt/pasu/.
References
Walsh, M. What is a Bed? Beds as a measure of resource usage and demand. Better Outcomes Health Newsletter. 4(3) (1998)
Zhang, L.M., Chang, H.Y., Xu, R.T.: The patient admission scheduling of an ophthalmic hospital using genetic algorithm. In: Information Technology Applications in Industry, Computer Engineering and Materials Science, vol. 756, pp. 1423–1432 (2013)
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)
Vancroonenburg, W., Della Croce, F., Goossens, D., Spieksma, F.C.R.: The red-blue transportation problem. Eur. J. Oper. Res. 237(3), 814–823 (2014)
Ceschia, S., Schaerf, A.: Local search and lower bounds for the patient admission scheduling problem. Comput. Oper. Res. 10(38), 1452–1463 (2011)
Troels, M.R., Lusby, R.M., Larsen, J.: A column generation approach for solving the patient admission scheduling problem. Eur. J. Oper. Res. 235(1), 252–264 (2014)
Guido, R., Groccia, M.C., Conforti, D.: An efficient matheuristic for offline patient-to-bed assignment problems. Eur. J. Oper. Res. 268(2), 486–503 (2018)
Bolaji, A.L., Bamigbola, A.F., Shola, P.B.: Late acceptance hill climbing algorithm for solving patient admission scheduling problem. Knowl. Based Syst. 145, 197–206 (2018)
Ceschia, S., Schaerf, A.: Modeling and solving the patient admission scheduling problem under uncertainty. Artif. Intell. Med. 56(3), 199–205 (2011)
Lusby, R.M., Schwierz, M., Range, T.M., Larsen, J.: An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem. Artif. Intell. Med. 74, 21–31 (2016)
Guido, R., Solina, V., Conforti, D.: Offline Patient admission scheduling problems. In: Sforza, A., Sterle, C. (eds.) Optimization and Decision Science: Methodologies and Applications, pp. 129–137. Springer International Publishing, Cham (2017)
Vancroonenburg, W., De Causmaecker, P., Vanden Berghe, G.: A study of decision support models for online patient-to-room assignment planning. Ann. Oper. Res. 239, 253–271 (2016)
Zhu, Y.-H., Toffolo, T.A.M., Vancroonenburg, W., Vanden Berghe, G.: Compatibility of short and long term objectives for dynamic patient admission scheduling. Comput. Oper. Res. 104, 98–112 (2019)
Bastos, L., Marchesi, S.L., Janaina, F., Hamacher, S., Fleck, J.L.: A mixed integer programming approach to the patient admission scheduling problem. Eur. J. Oper. Res. 273(3), 831–840 (2019)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
Acknowledgements
The research has been partially supported by the research project “SI.F.I.PA.CRO.DE. Sviluppo e industrializzazione farmaci innovativi per terapia molecolare personalizzata PA.CRO.DE. (PON ARS01_00568, CUP: B29C20000360005, CONCESSIONE RNA-COR: 4646672), Italian Ministry of University and Research, 2021.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Guido, R., Ceschia, S., Conforti, D. (2021). Modelling and Solving Patient Admission and Hospital Stay Problems. In: Cerulli, R., Dell'Amico, M., Guerriero, F., Pacciarelli, D., Sforza, A. (eds) Optimization and Decision Science. AIRO Springer Series, vol 7. Springer, Cham. https://doi.org/10.1007/978-3-030-86841-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-86841-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86840-6
Online ISBN: 978-3-030-86841-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)