Simulated annealing approach for outpatient scheduling in a haemodialysis unit

2022;
: pp. 860–870
https://doi.org/10.23939/mmc2022.04.860
Received: August 11, 2022
Accepted: September 04, 2022

Mathematical Modeling and Computing, Vol. 9, No. 4, pp. 860–870 (2022)

1
Department of Mathematics and Statistics, Faculty of Science, University of Putra Malaysia
2
Department of Mathematics and Statistics, Faculty of Science, University of Putra Malaysia
3
Department of Mathematics and Statistics, Faculty of Science, University of Putra Malaysia
4
Department of Mathematics and Statistics, Faculty of Science, University of Putra Malaysia

National Renal Registry Malaysia has reported that the dialysis treatment demand among chronic kidney and end-stage kidney disease patients rises yearly.  However, available haemodialysis (HD) units have limited facilities to meet the current and increasing demand.  This leads to congestion, long waiting times, and an increase in the duration of treatment (DOT) among HD patients during their treatment sessions.  Two essential factors in providing optimal treatment plans are outpatient scheduling and nurse assignment.  Therefore, the objectives of this study are to minimise patients' total DOT, including the waiting time for pre-dialysis and post-dialysis sessions, which also includes determining the amount of patient flow in an HD unit.  Regarding the first objective, we include simulated annealing (SA) into our simple heuristics (SH) in the patient scheduling optimisation model.  Here, the initial solution obtained from the method can be improved.  The backtracking heuristic (BH) is then applied to the nurse assignment problem, where at least two nurses are needed for each dialysis patient.  The results show that the solutions obtained for outpatient scheduling by SA are efficient and have significantly reduced the computational time compared with the SH, even when considering more patients on the waiting list.  As for total DOT, we obtain the optimum value compared to the average DOT values for both 3-hour and 4-hour sessions.  Besides, a discrete-event simulation (DES) experiment of patient flow in an HD unit was performed by gradual variations in patient arrival rates, $\lambda$, to avoid congestion in the system.  DES has the potential to accommodate emergency patients that seek HD treatment without causing much disruption to the system.

  1. Coresh J., Selvin E., Stevens L. A., Manzi J., Kusek J. W., Eggers P., Van Lente F., Levey A. S.  Prevalence of Chronic Kidney Disease in the United States.  JAMA.  298 (17), 2038–2047 (2007).
  2. Choi J. W., Lee H., Lee J. C., Lee S., Kim Y. S., Yoon H. J., Kim H. C.  Application of genetic algorithm for hemodialysis schedule optimization.  Computer Methods and Programs in Biomedicine.  145, 35–43 (2017).
  3. Jefferies H. J., Virk B., Schiller B., Moran J., McIntyre C. W.  Frequent Hemodialysis Schedules Are Associated with Reduced Levels of Dialysis-induced Cardiac Injury (Myocardial Stunning).  Clinical journal of the American Society of Nephrology.  6 (6), 1326–1332 (2011).
  4. Azadeh A., Baghersad M., Farahani M. H., Zarrin M.  Semi-online patient scheduling in pathology laboratories.  Artificial Intelligence in Medicine.  64 (3), 217–226 (2015).
  5. Yan C., Tang J., Jiang B., Fung R. Y.  Sequential appointment scheduling considering patient choice and service fairness.  International Journal of Production Research.  53 (24), 7376–7395 (2015).
  6. Powell N. H.  Simulation and optimization of healthcare workforce need.  PhD thesis, University of Southampton (2006).
  7. Holland J.  Scheduling patients in hemodialysis centers.  Production and Inventory Management Journal.  35 (2), 76 (1994).
  8. Peña M. A. T.  Optimization of inpatient hemodialysis scheduling considering efficiency and treatment delays to minimize length of stay.  Thesis. Rochester Institute of Technology (2013).
  9. Fleming R., Gartner D., Padman R., James D.  An analytical approach for improving patient-centric delivery of dialysis services.  AMIA Annu Symp Proc. 2019, 418–427 (2019).
  10. Liu Z., Lu J., Liu Z., Liao G., Zhang H. H., Dong J.  Patient scheduling in hemodialysis service.  Journal of Combinatorial Optimization.  37, 337–362 (2019).
  11. Nwaneri S. C., Ezeagbor J. O., Orunsholu D. O. T., Anyaeche C. O.  Optimisation of Patient Flow and Scheduling in an Outpatient Haemodialysis Clinic.  Nigerian Journal of Technological Development.  18 (2), 119–128 (2021).
  12. Daknou A., Zgaya H., Hammadi S., Hubert H.  A dynamic patient scheduling at the emergency department in hospitals.  2010 IEEE Workshop on Health Care Management (WHCM). 1–6 (2010).
  13. Paulussen T. O., Zöller A., Rothlauf F., Heinzl A., Braubach L., Pokahr A., Lamersdorf W.  Agent-Based Patient Scheduling in Hospitals.  Multiagent Engineering. 255–275 (2006).
  14. Fathollahi–Fard A. M., Govindan K., Hajiaghaei–Keshteli M., Ahmadi A.  A green home health care supply chain: New modified simulated annealing algorithms.  Journal of Cleaner Production.  240, 118200 (2019).
  15. Fügener A., Hans E. W., Kolisch R., Kortbeek N., Vanberkel P. T.  Master surgery scheduling with consideration of multiple downstream units.  European Journal of Operational Research.  239 (1), 227–236 (2014).
  16. Sundar A., Rahmin N. A. A., Chen C. Y., Nazihah M. A.  Patient Scheduling in Hemodialysis Unit Using Simple Heuristic.  Menemui Matematik (Discovering Mathematics).  43, 40–53 (2021).
  17. Tan Y., El Mekkawy T., Peng Q., Wright B.  Analysis of Surgical Patient Flow at Winnipeg Health Sciences Centre.  Proceedings of the Canadian Enginering Education Association (CEEA), (2007).
  18. Li X., Rafaliya N., Baki M. F., Chaouch B. A.  Scheduling elective surgeries: the tradeoff among bed capacity, waiting patients and operating room utilization using goal programming.  Health Care Management Science.  20, 33–54 (2017).
  19. Wang L., Demeulemeester E., Vansteenkiste N., Rademakers F. E.  Operating room planning and scheduling for outpatients and inpatients: A review and future research.  Operations Research for Health Care.  31, 100323 (2021).
  20. Liu Z., Liu Z., Zhu Z., Shen Y., Dong J.  Simulated annealing for a multi-level nurse rostering problem in hemodialysis service.  Applied Soft Computing.  64, 148–160 (2018).
  21. Kirkpatrick S., Gelatt C. D., Vecchi M. P.  Optimization by Simulated Annealing.  Science.  220 (4598), 671–680 (1983).
  22. Varga A.  The OMNeT++ Discrete event simulation system.  Proceedings of the European Simulation Multiconference (ESM'01). 1–7 (2001).
  23. Gagniuc P. A.  Markov Chains: From Theory to Implementation and Experimentation.  John Wiley & Sons (2017).
  24. Van Rossum G. et al.  Python Programming Language,  in USENIX annual technical conference.  41, 36 (2007).