EUVIMEDEUVIMED entdecken
Crossref

A reinforcement learning approach for the online dynamic home health care scheduling problem

Quy Ta-Dinh, Tu-San Pham, Minh Hoàng Hà, Louis-Martin Rousseau

Health Care Management Science · 2024-12 · 27 (4) · 650-664

DOI: 10.1007/s10729-024-09692-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Health Care Management Science, online erschienen am 14.11.2024. Verfasst von Quy Ta-Dinh und 3 weiteren Autor:innen. Beteiligte Einrichtung: ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam. Hauptthemen laut MEDLINE: Appointments and Schedules, Home Care Services, Markov Chains, Algorithms. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 23 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Over recent years, home health care has gained significant attention as an efficient solution to the increasing demand for healthcare services. Home health care scheduling is a challenging problem involving multiple complicated assignments and routing decisions subject to various constraints. The problem becomes even more challenging when considered on a rolling horizon with stochastic patient requests. This paper discusses the Online Dynamic Home Health Care Scheduling Problem (ODHHCSP), in which a home health care agency has to decide whether to accept or reject a patient request and determine the visit schedule and routes in case of acceptance. The objective of the problem is to maximize the number of patients served, given the limited resources. When the agency receives a patient's request, a decision must be made on the spot, which poses many challenges, such as stochastic future requests or a limited time budget for decision-making. In this paper, we model the problem as a Markov decision process and propose a reinforcement learning (RL) approach. The experimental results show that the proposed approach outperforms other algorithms in the literature in terms of solution quality. In addition, a constant runtime of less than 0.001 seconds for each decision makes the approach especially suitable for an online setting like our problem.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Appointments and SchedulesHome Care ServicesMarkov ChainsAlgorithmsHumansReinforcement, PsychologyEfficiency, Organizational

Stichwörter der Autor:innen

Dynamic problemHome health care schedulingReinforcement learning

Autor:innen und Institutionen

  • ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam.
  • Department of Mathematics and Industrial Engineering, Polytechnique Montreal, Quebec, Canada.
  • SLSCM, Faculty of Data Science and Artificial Intelligence, College of Technology, National Economics University, Hanoi, Vietnam. hoanghm@neu.edu.vn.

Zitieren

APA

Ta-Dinh, Q., Pham, T. S., Hà, M. H., & Rousseau, L. M. (2024). A reinforcement learning approach for the online dynamic home health care scheduling problem. Health Care Management Science, 27(4), 650-664. https://doi.org/10.1007/s10729-024-09692-5

Vancouver

Ta-Dinh Q, Pham TS, Hà MH, Rousseau LM. A reinforcement learning approach for the online dynamic home health care scheduling problem. Health Care Management Science. 2024;27(4):650-664. doi:10.1007/s10729-024-09692-5

BibTeX
@article{TaDinh2024,
  author = {Ta-Dinh, Quy and Pham, Tu-San and Hà, Minh Hoàng and Rousseau, Louis-Martin},
  title = {A reinforcement learning approach for the online dynamic home health care scheduling problem},
  journal = {Health Care Management Science},
  year = {2024},
  volume = {27},
  number = {4},
  pages = {650--664},
  doi = {10.1007/s10729-024-09692-5}
}
Kostenlos starten →