EconPapers    
Economics at your fingertips  
 

Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization

Vahid Akbari (vahid.akbari@nottingham.ac.uk), İhsan Sadati (msadati@sabanciuniv.edu), F. Sibel Salman (ssalman@ku.edu.tr) and Davood Shiri (d.shiri@sheffield.ac.uk)
Additional contact information
Vahid Akbari: University of Nottingham
İhsan Sadati: Sabanci University
F. Sibel Salman: Koç University
Davood Shiri: University of Sheffield

OR Spectrum: Quantitative Approaches in Management, 2023, vol. 45, issue 3, No 3, 807-852

Abstract: Abstract We study a home healthcare routing and scheduling problem, where multiple healthcare service provider teams should visit a given set of patients at their homes. The problem involves assigning each patient to a team and generating the routes of the teams such that each patient is visited once. When patients are prioritized according to the severity of their condition or their service urgency, the problem minimizes the total weighted waiting time of the patients, where the weights represent the triage levels. In this form, the problem generalizes the multiple traveling repairman problem. To obtain optimal solutions for small to moderate-size instances, we propose a level-based integer programming (IP) model on a transformed input network. To solve larger instances, we develop a metaheuristic algorithm that relies on a customized saving procedure and a general variable neighborhood search algorithm. We evaluate the IP model and the metaheuristic on various small-, medium- and large-sized instances coming from the vehicle routing literature. While the IP model finds the optimal solutions to all the small- and medium-sized instances within three hours of run time, the metaheuristic algorithm achieves the optimal solutions to all instances within merely a few seconds. We also provide a case study involving Covid-19 patients in a district of Istanbul and derive insights for the planners by means of several analyses.

Keywords: Home healthcare; Personnel routing; Prioritized patient scheduling; Multiple traveling repairman problem; Variable neighborhood search (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00291-023-00713-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:orspec:v:45:y:2023:i:3:d:10.1007_s00291-023-00713-3

Ordering information: This journal article can be ordered from
http://www.springer. ... research/journal/291

DOI: 10.1007/s00291-023-00713-3

Access Statistics for this article

OR Spectrum: Quantitative Approaches in Management is currently edited by Rainer Kolisch

More articles in OR Spectrum: Quantitative Approaches in Management from Springer, Gesellschaft für Operations Research e.V.
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).

 
Page updated 2024-12-29
Handle: RePEc:spr:orspec:v:45:y:2023:i:3:d:10.1007_s00291-023-00713-3