Home health care logistics planning: a review and framework

Emiliano, William Machado; Telhada, José; Carvalho, Maria Sameiro

doi:10.1016/j.promfg.2017.09.165

Cited by 28 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two of the main operational decisions in HHC are routing and scheduling. These two decisions can be made individually or simultaneously [27]. The literature contains a number of studies that focus only on routing in HHC.…”

Section: ) Vehicle Routing Problems In Hhcmentioning

confidence: 99%

The Multi-Depot Cumulative Vehicle Routing Problem With Mandatory Visit Times and Minimum Delayed Latency

et al. 2021

View full text Add to dashboard Cite

This paper introduces a novel variant of the cumulative vehicle routing problem (CCVRP) that deals with home health care (HHC) logistics. It includes multiple nonfixed depots and emergency trips from patients to the closest depot. The aim is to minimize the system's delayed latency by satisfying mandatory visit times. Delayed latency corresponds to caregivers' total overtime hours worked while visiting patients. A new mixed-integer linear programming model is proposed to address this problem. Computational experiments, with more than 165 new benchmark instances, are carried out using the CPLEX and Gurobi MIP solvers. The results indicate that patients' geographical distribution directly impacts the complexity of the problem. An analysis of the model parameters proves that instances with more depots/vehicles or longer workdays are significantly easier to solve than are original cases. The results show that Gurobi outperforms CPLEX in 55% of the instances analyzed, while CPLEX performs better in only 16% of them. To the best of our knowledge, this is the first VRP that minimizes delayed latency and the first HHC routing study to use a cumulative objective function.

show abstract

Section: ) Vehicle Routing Problems In Hhcmentioning

confidence: 99%

The Multi-Depot Cumulative Vehicle Routing Problem With Mandatory Visit Times and Minimum Delayed Latency

et al. 2021

View full text Add to dashboard Cite

show abstract

“…The HHCRSP might be seen as an extension of vehicle routing problem (VRP) augmented by many unusual side constraints that are specific to the HHD context (Cissé et al , 2017). Consequently, it is unlikely that a single standard version modeling the HHCRSP will be suitable to the wide spectrum of situations posed by the health-care systems, which might be partially explained by the many differences existing across countries' policies and regulations (Grenouilleau et al , 2019; Emiliano et al , 2017).…”

Section: Related Research Workmentioning

confidence: 99%

“…To the best of the authors' knowledge, the HHCRSP was first considered by Fernandez et al (1974), who investigated the daily routing of nurses in a rural county in the UK. Nowadays, the HHCRSP is often divided into several levels, where decisions are separated into strategic, tactical and operational (Gutiérrez and Vidal, 2013; Maya Duque et al , 2015; Emiliano et al , 2017). In general, it can be said that the HHCRSP often mixes the design of the health-care providers and services network, decisions about staff dimensioning and workforce scheduling problems, with some form of routing that might span several time periods (Castillo-Salazar et al , 2016).…”

Section: Related Research Workmentioning

confidence: 99%

A network flow-based model for operations planning in home health care delivery

Castaño

Velasco

2020

IJLM

View full text Add to dashboard Cite

PurposeTo solve the problem, a mathematical model is proposed; it relies on a directed acyclic graph (DAG), in which arcs are used to indicate whether a pair of appointments can be assigned to the same route or not (and so to the same care worker). The proposed model aims at minimizing the personnel required to meet daily demand and balancing workloads among the workers while considering the varying traffic patterns derived from traffic congestion.Design/methodology/approachThis paper aims at providing solution approaches for addressing the problem of assigning care workers to deliver home health-care (HHC) services, demanding different skills each. First, a capacity planning problem is considered, where it is necessary to define the number of workers required to satisfy patients' requests and then, patients are assigned to the care workers along with the sequence followed to visit them, thus solving a scheduling problem. The benefits obtained by permitting patients to propose multiple time slots where they can be served are also explored.FindingsThe results indicate that the problem can be efficiently solved for medium-sized instances, that is, up to 100 daily patient requests. It is also indicated that asking patients to propose several moments when they can receive services helps to minimize the need for care workers through more efficient route allocations without affecting significantly the balance of the workloads.Originality/valueThis article provides a new framework for modeling and solving a HHC routing problem with multiskilled personnel. The proposed model can be used to identify efficient daily plans and can handle realistic characteristics such as time-dependent travel times or be extended to other real-life applications such as maintenance scheduling problems.

show abstract

“…Given the high transportation costs in the healthcare industry, research related to the optimization of logistics routes in home healthcare is essential. A state-of-the-art review of different problems associated with HHC is presented by Emiliano et al [30] and Gutiérrez and Vidal [31].…”

Section: State Of the Artmentioning

confidence: 99%

A Two-Phase Heuristic Algorithm for the Problem of Scheduling and Vehicle Routing for Delivery of Medication to Patients

Linfati

Escobar

Escalona

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In this paper, a two-phase hybrid algorithm to address the problem of scheduling visits to customers and the vehicle routing problem of medication delivery to highly dependent patients is proposed. In the first phase, the issue of daily scheduling for a cluster of customers is solved via a flexible mathematical optimization model applied to different scenarios. The solution obtained in the first phase generates n clusters of patients and a frequency routing problem that considers delivery periodicity, location, demand, service times, travel times, and daily load-balancing constraints. In the second phase, a hybrid metaheuristic approach including the synergy and constant iteration between simulated annealing and a record-to-record algorithm is applied to improve the initial solution obtained in the first phase. The effectiveness of the proposed algorithm is validated with real data obtained from a pilot project in Chile. The results are promising and demonstrate the efficiency of the proposed methodology.

show abstract

Home health care logistics planning: a review and framework

Cited by 28 publications

References 15 publications

The Multi-Depot Cumulative Vehicle Routing Problem With Mandatory Visit Times and Minimum Delayed Latency

The Multi-Depot Cumulative Vehicle Routing Problem With Mandatory Visit Times and Minimum Delayed Latency

A network flow-based model for operations planning in home health care delivery

A Two-Phase Heuristic Algorithm for the Problem of Scheduling and Vehicle Routing for Delivery of Medication to Patients

Contact Info

Product

Resources

About