IDEAS home Printed from https://ideas.repec.org/a/kap/hcarem/v26y2023i4d10.1007_s10729-023-09652-5.html
   My bibliography  Save this article

Combining machine learning and optimization for the operational patient-bed assignment problem

Author

Listed:
  • Fabian Schäfer

    (Technical University of Munich, Campus Straubing for Biotechnology and Sustainability, Supply Chain and Value Management)

  • Manuel Walther

    (Catholic University of Eichstätt-Ingolstadt, Supply Chain Management & Operations)

  • Dominik G. Grimm

    (Technical University of Munich, Campus Straubing for Biotechnology and Sustainability, Bioinformatics
    Weihenstephan-Triesdorf University of Applied Sciences, Bioinformatics
    Technical University of Munich)

  • Alexander Hübner

    (Technical University of Munich, Campus Straubing for Biotechnology and Sustainability, Supply Chain and Value Management)

Abstract

Assigning inpatients to hospital beds impacts patient satisfaction and the workload of nurses and doctors. The assignment is subject to unknown inpatient arrivals, in particular for emergency patients. Hospitals, therefore, need to deal with uncertainty on actual bed requirements and potential shortage situations as bed capacities are limited. This paper develops a model and solution approach for solving the patient bed-assignment problem that is based on a machine learning (ML) approach to forecasting emergency patients. First, it contributes by improving the anticipation of emergency patients using ML approaches, incorporating weather data, time and dates, important local and regional events, as well as current and historical occupancy levels. Drawing on real-life data from a large case hospital, we were able to improve forecasting accuracy for emergency inpatient arrivals. We achieved up to 17% better root mean square error (RMSE) when using ML methods compared to a baseline approach relying on averages for historical arrival rates. We further show that the ML methods outperform time series forecasts. Second, we develop a new hyper-heuristic for solving real-life problem instances based on the pilot method and a specialized greedy look-ahead (GLA) heuristic. When applying the hyper-heuristic in test sets we were able to increase the objective function by up to 5.3% in comparison to the benchmark approach in [40]. A benchmark with a Genetic Algorithm shows also the superiority of the hyper-heuristic. Third, the combination of ML for emergency patient admission forecasting with advanced optimization through the hyper-heuristic allowed us to obtain an improvement of up to 3.3% on a real-life problem.

Suggested Citation

  • Fabian Schäfer & Manuel Walther & Dominik G. Grimm & Alexander Hübner, 2023. "Combining machine learning and optimization for the operational patient-bed assignment problem," Health Care Management Science, Springer, vol. 26(4), pages 785-806, December.
  • Handle: RePEc:kap:hcarem:v:26:y:2023:i:4:d:10.1007_s10729-023-09652-5
    DOI: 10.1007/s10729-023-09652-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10729-023-09652-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10729-023-09652-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peter R. Winters, 1960. "Forecasting Sales by Exponentially Weighted Moving Averages," Management Science, INFORMS, vol. 6(3), pages 324-342, April.
    2. Wim Vancroonenburg & Patrick Causmaecker & Greet Vanden Berghe, 2016. "A study of decision support models for online patient-to-room assignment planning," Annals of Operations Research, Springer, vol. 239(1), pages 253-271, April.
    3. Stefan Voßs & Andreas Fink & Cees Duin, 2005. "Looking Ahead with the Pilot Method," Annals of Operations Research, Springer, vol. 136(1), pages 285-302, April.
    4. Guido, Rosita & Groccia, Maria Carmela & Conforti, Domenico, 2018. "An efficient matheuristic for offline patient-to-bed assignment problems," European Journal of Operational Research, Elsevier, vol. 268(2), pages 486-503.
    5. Alexander Hübner & Heinrich Kuhn & Manuel Walther, 2018. "Combining clinical departments and wards in maximum-care hospitals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 679-709, July.
    6. Thomas J. Best & Burhaneddin Sandıkçı & Donald D. Eisenstein & David O. Meltzer, 2015. "Managing Hospital Inpatient Bed Capacity Through Partitioning Care into Focused Wings," Manufacturing & Service Operations Management, INFORMS, vol. 17(2), pages 157-176, May.
    7. Kursa, Miron B. & Rudnicki, Witold R., 2010. "Feature Selection with the Boruta Package," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 36(i11).
    8. Hyndman, Rob J. & Khandakar, Yeasmin, 2008. "Automatic Time Series Forecasting: The forecast Package for R," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 27(i03).
    9. Erhard, Melanie & Schoenfelder, Jan & Fügener, Andreas & Brunner, Jens O., 2018. "State of the art in physician scheduling," European Journal of Operational Research, Elsevier, vol. 265(1), pages 1-18.
    10. Bastos, Leonardo S.L. & Marchesi, Janaina F. & Hamacher, Silvio & Fleck, Julia L., 2019. "A mixed integer programming approach to the patient admission scheduling problem," European Journal of Operational Research, Elsevier, vol. 273(3), pages 831-840.
    11. Fügener, Andreas & Hans, Erwin W. & Kolisch, Rainer & Kortbeek, Nikky & Vanberkel, Peter T., 2014. "Master surgery scheduling with consideration of multiple downstream units," European Journal of Operational Research, Elsevier, vol. 239(1), pages 227-236.
    12. Fabian Schäfer & Manuel Walther & Alexander Hübner & Heinrich Kuhn, 2019. "Operational patient-bed assignment problem in large hospital settings including overflow and uncertainty management," Flexible Services and Manufacturing Journal, Springer, vol. 31(4), pages 1012-1041, December.
    13. Hui Zou & Trevor Hastie, 2005. "Addendum: Regularization and variable selection via the elastic net," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(5), pages 768-768, November.
    14. Lusby, Richard Martin & Schwierz, Martin & Range, Troels Martin & Larsen, Jesper, 2016. "An Adaptive Large Neighbourhood Search Procedure Applied to the Dynamic Patient Admission Scheduling Problem," Discussion Papers on Economics 1/2016, University of Southern Denmark, Department of Economics.
    15. Hui Zou & Trevor Hastie, 2005. "Regularization and variable selection via the elastic net," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(2), pages 301-320, April.
    16. Ming Yuan & Yi Lin, 2006. "Model selection and estimation in regression with grouped variables," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 68(1), pages 49-67, February.
    17. Peter J. H. Hulshof & Martijn R. K. Mes & Richard J. Boucherie & Erwin W. Hans, 2016. "Patient admission planning using Approximate Dynamic Programming," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 30-61, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Haichao & Wang, Yang & Hao, Jin-Kao, 2024. "Solving the patient admission scheduling problem using constraint aggregation," European Journal of Operational Research, Elsevier, vol. 316(1), pages 85-99.
    2. Fabian Schäfer & Manuel Walther & Alexander Hübner & Heinrich Kuhn, 2019. "Operational patient-bed assignment problem in large hospital settings including overflow and uncertainty management," Flexible Services and Manufacturing Journal, Springer, vol. 31(4), pages 1012-1041, December.
    3. Merten, Michael & Rücker, Fabian & Schoeneberger, Ilka & Sauer, Dirk Uwe, 2020. "Automatic frequency restoration reserve market prediction: Methodology and comparison of various approaches," Applied Energy, Elsevier, vol. 268(C).
    4. Tutz, Gerhard & Pößnecker, Wolfgang & Uhlmann, Lorenz, 2015. "Variable selection in general multinomial logit models," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 207-222.
    5. Shuichi Kawano, 2014. "Selection of tuning parameters in bridge regression models via Bayesian information criterion," Statistical Papers, Springer, vol. 55(4), pages 1207-1223, November.
    6. Yize Zhao & Matthias Chung & Brent A. Johnson & Carlos S. Moreno & Qi Long, 2016. "Hierarchical Feature Selection Incorporating Known and Novel Biological Information: Identifying Genomic Features Related to Prostate Cancer Recurrence," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 111(516), pages 1427-1439, October.
    7. Bilin Zeng & Xuerong Meggie Wen & Lixing Zhu, 2017. "A link-free sparse group variable selection method for single-index model," Journal of Applied Statistics, Taylor & Francis Journals, vol. 44(13), pages 2388-2400, October.
    8. Capanu, Marinela & Giurcanu, Mihai & Begg, Colin B. & Gönen, Mithat, 2023. "Subsampling based variable selection for generalized linear models," Computational Statistics & Data Analysis, Elsevier, vol. 184(C).
    9. Yu-Min Yen, 2010. "A Note on Sparse Minimum Variance Portfolios and Coordinate-Wise Descent Algorithms," Papers 1005.5082, arXiv.org, revised Sep 2013.
    10. Tomáš Plíhal, 2021. "Scheduled macroeconomic news announcements and Forex volatility forecasting," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 40(8), pages 1379-1397, December.
    11. Loann David Denis Desboulets, 2018. "A Review on Variable Selection in Regression Analysis," Econometrics, MDPI, vol. 6(4), pages 1-27, November.
    12. Osamu Komori & Shinto Eguchi & John B. Copas, 2015. "Generalized t-statistic for two-group classification," Biometrics, The International Biometric Society, vol. 71(2), pages 404-416, June.
    13. Murat Genç & M. Revan Özkale, 2021. "Usage of the GO estimator in high dimensional linear models," Computational Statistics, Springer, vol. 36(1), pages 217-239, March.
    14. Victor Chernozhukov & Christian Hansen & Yuan Liao, 2015. "A lava attack on the recovery of sums of dense and sparse signals," CeMMAP working papers CWP56/15, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    15. Wang, Shixuan & Syntetos, Aris A. & Liu, Ying & Di Cairano-Gilfedder, Carla & Naim, Mohamed M., 2023. "Improving automotive garage operations by categorical forecasts using a large number of variables," European Journal of Operational Research, Elsevier, vol. 306(2), pages 893-908.
    16. Zhang, Tonglin, 2024. "Variables selection using L0 penalty," Computational Statistics & Data Analysis, Elsevier, vol. 190(C).
    17. Takumi Saegusa & Tianzhou Ma & Gang Li & Ying Qing Chen & Mei-Ling Ting Lee, 2020. "Variable Selection in Threshold Regression Model with Applications to HIV Drug Adherence Data," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 12(3), pages 376-398, December.
    18. Paolo Fornaro & Henri Luomaranta, 2020. "Nowcasting Finnish real economic activity: a machine learning approach," Empirical Economics, Springer, vol. 58(1), pages 55-71, January.
    19. Zeng, Yaohui & Yang, Tianbao & Breheny, Patrick, 2021. "Hybrid safe–strong rules for efficient optimization in lasso-type problems," Computational Statistics & Data Analysis, Elsevier, vol. 153(C).
    20. Ruidi Chen & Ioannis Ch. Paschalidis, 2022. "Robust Grouped Variable Selection Using Distributionally Robust Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 1042-1071, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:hcarem:v:26:y:2023:i:4:d:10.1007_s10729-023-09652-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.