A Decision Support System for daily scheduling and routing of home healthcare workers with a lunch break consideration
- URL: http://arxiv.org/abs/2412.06797v1
- Date: Fri, 22 Nov 2024 16:18:09 GMT
- Title: A Decision Support System for daily scheduling and routing of home healthcare workers with a lunch break consideration
- Authors: Ömer Öztürkoğlu, Gökberk Özsakallı, Syed Shah Sultan Mohiuddin Qadri,
- Abstract summary: This study examines a home healthcare scheduling and routing problem (HHSRP) with a lunch break requirement.<n>The objective is to minimize both travel distance in a route and unvisited patient (penalty) cost.<n>We developed an effective Adaptive Large Neighborhood Search algorithm to provide high-quality solutions in a short amount of time.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This study examines a home healthcare scheduling and routing problem (HHSRP) with a lunch break requirement. This problem especially consists of lunch break constraints for caregivers in addition to other typical features of the HHSRP in literature such as hard time window constraints for both patients and caregivers and patient preferences. The objective is to minimize both travel distance in a route and unvisited patient (penalty) cost. For this NP-Hard problem, we developed an effective Adaptive Large Neighborhood Search algorithm to provide high-quality solutions in a short amount of time. We tested the proposed four variants of the algorithm with the selected problem instances from the literature. The algorithms provided nearly all optimal solutions for 30-patient problem instances in 12 seconds on average. Additionally, they provided better solutions to 36 problem instances up to 36% improvement in some instance classes. Moreover, the improved solutions achieved to visit up to 10 more patients. The algorithms are also shown to be very robust due to their low coefficient variance of 0.3 on average. The algorithm also requires a very reasonable amount of time to generate solutions up to 54 seconds for solving 100-patient instances. A decision support system, namely Home Healthcare Decision Support System (HHCSS) was also designed to play a positive role in preventing the COVID-19 global pandemic. The system employs the proposed ALNS algorithm to solve various instances of approximately generated COVID-19 patient data from Turkey. The main aim of developing HHCSS is to support the administrative staff of home healthcare from the tedious task of scheduling and routing of caregivers and to increase service responsiveness.
Related papers
- A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation [61.08720171136229]
Coalition structure generation is a fundamental computational problem in multiagent systems.
We develop SALDAE, a multiagent path finding algorithm for CSG that operates on a graph of coalition structures.
arXiv Detail & Related papers (2025-02-14T15:21:27Z) - Random-Key Algorithms for Optimizing Integrated Operating Room Scheduling [0.16385815610837165]
This study introduces a novel concept of Random-Key (RKO), rigorously tested on literature and new real-world inspired instances.
Our literature optimization problem incorporates multi-room scheduling, equipment scheduling, and complex availability constraints.
The RKO approach represents solutions as points in a continuous space, which are then mapped in the problem solution space via a deterministic function known as a decoder.
arXiv Detail & Related papers (2025-01-17T15:11:30Z) - Development of a Large Language Model-based Multi-Agent Clinical Decision Support System for Korean Triage and Acuity Scale (KTAS)-Based Triage and Treatment Planning in Emergency Departments [0.0]
This study presents an LLM-driven CDSS to assist ED physicians and nurses in patient triage, treatment planning, and overall emergency care management.
The system comprises four AI agents emulating key ED roles: Triage Nurse, Emergency Physician, Pharmacist, and ED Coordinator.
It incorporates the Korean Triage and Acuity Scale (KTAS) for triage assessment and integrates with the RxNorm API for medication management.
arXiv Detail & Related papers (2024-08-14T13:03:41Z) - Learning Task Decomposition to Assist Humans in Competitive Programming [90.4846613669734]
We introduce a novel objective for learning task decomposition, termed value (AssistV)
We collect a dataset of human repair experiences on different decomposed solutions.
Under 177 hours of human study, our method enables non-experts to solve 33.3% more problems, speeds them up by 3.3x, and empowers them to match unassisted experts.
arXiv Detail & Related papers (2024-06-07T03:27:51Z) - Uncertainty of Thoughts: Uncertainty-Aware Planning Enhances Information Seeking in Large Language Models [73.79091519226026]
Uncertainty of Thoughts (UoT) is an algorithm to augment large language models with the ability to actively seek information by asking effective questions.
In experiments on medical diagnosis, troubleshooting, and the 20 Questions game, UoT achieves an average performance improvement of 38.1% in the rate of successful task completion.
arXiv Detail & Related papers (2024-02-05T18:28:44Z) - Learning to repeatedly solve routing problems [5.08128537391027]
We present a learned for the reoptimization of a problem after a minor change in its data.
Given the edges of an original solution, the goal is to predict and fix the ones that have a high chance of remaining in an optimal solution.
This partial prediction of the solution reduces the complexity of the problem and speeds up its resolution.
arXiv Detail & Related papers (2022-12-15T19:33:54Z) - Learning to Optimize Permutation Flow Shop Scheduling via Graph-based
Imitation Learning [70.65666982566655]
Permutation flow shop scheduling (PFSS) is widely used in manufacturing systems.
We propose to train the model via expert-driven imitation learning, which accelerates convergence more stably and accurately.
Our model's network parameters are reduced to only 37% of theirs, and the solution gap of our model towards the expert solutions decreases from 6.8% to 1.3% on average.
arXiv Detail & Related papers (2022-10-31T09:46:26Z) - Machine learning-based patient selection in an emergency department [0.0]
This paper investigates the potential of an Machine Learning (ML) based patient selection method.
It incorporates a comprehensive state representation of the system and a complex non-linear selection function.
Results show that the proposed method significantly outperforms the APQ method for a majority of evaluated settings.
arXiv Detail & Related papers (2022-06-08T08:56:52Z) - An Integrated Optimization and Machine Learning Models to Predict the
Admission Status of Emergency Patients [1.0323063834827415]
Three machine learning algorithms are proposed: T-XGB, T-ADAB, and T-MLP.
The proposed framework can mitigate the crowding problem by proactively planning the patient boarding process.
The results show that the newly proposed algorithms resulted in high AUC and outperformed the traditional algorithms.
arXiv Detail & Related papers (2022-02-18T13:50:44Z) - Resource Planning for Hospitals Under Special Consideration of the
COVID-19 Pandemic: Optimization and Sensitivity Analysis [87.31348761201716]
Crises like the COVID-19 pandemic pose a serious challenge to health-care institutions.
BaBSim.Hospital is a tool for capacity planning based on discrete event simulation.
We aim to investigate and optimize these parameters to improve BaBSim.Hospital.
arXiv Detail & Related papers (2021-05-16T12:38:35Z) - Operating Room (Re)Scheduling with Bed Management via ASP [8.189696720657247]
We first present a solution to the problem based on Answer Set Programming (ASP)
The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling.
We also present an ASP solution for the rescheduling problem, i.e. when the off-line schedule cannot be completed for some reason.
arXiv Detail & Related papers (2021-05-05T18:51:22Z) - A Machine Learning Approach for Task and Resource Allocation in Mobile
Edge Computing Based Networks [108.57859531628264]
A joint task, spectrum, and transmit power allocation problem is investigated for a wireless network.
The proposed algorithm can reduce the number of iterations needed for convergence and the maximal delay among all users by up to 18% and 11.1% compared to the standard Q-learning algorithm.
arXiv Detail & Related papers (2020-07-20T13:46:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.