An exact algorithm for the resource constrained home health care vehicle routing problem

Tanoumand, Neda; Ünlüyurt, Tonguç

doi:10.1007/s10479-021-04061-9

Cited by 16 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tanoumand and Ünlüyurt [19] considered new resource constraints: there are two types of personnel providing the service, but the number of personnel is limited. Then, they proposed an exact algorithm, the branch-and-price algorithm, to solve the problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Tabu Search with Variable Neighborhood Search Algorithm for Home Healthcare Routing Problem for Multiple Hospitals with Balanced Workload

DİNÇ YALÇIN,

YAVUZ,

ALTINTAŞ

2023

Academic Platform Journal of Engineering and Smart Systems

View full text Add to dashboard Cite

In this paper, we study home healthcare routing and scheduling problem where multiple hospitals serve patients. In the public hospitals in healthcare system of Türkiye, patients requiring home healthcare are assigned to the hospital that serves their place of residence. This can cause the workload of hospitals to become unbalanced in terms of the time needed for both traveling and operation. The aim of this paper is to generate routes with a balanced workload for hospitals, giving consideration to the time windows of patients and the working hours of health workers. Firstly, we construct a mathematical model which can solve toy and small-scale problems whilst taking into account the importance of a balanced workload. Then, a Tabu Search with a Variable Neighborhood Search (TS-VNS) algorithm is developed to solve large-scale problems. The performance of the TS-VNS algorithm is tested by comparing the results of the mathematical model with the generated test problems at a small scale. Additionally, large-scale test problems from the literature are sourced for the problem and solved by the TS-VNS algorithm. The results demonstrate the efficiency of the TS-VNS algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Tabu Search with Variable Neighborhood Search Algorithm for Home Healthcare Routing Problem for Multiple Hospitals with Balanced Workload

DİNÇ YALÇIN,

YAVUZ,

ALTINTAŞ

2023

Academic Platform Journal of Engineering and Smart Systems

View full text Add to dashboard Cite

show abstract

“…In general, the HHC routing and scheduling problems often aim to minimize the transportation costs. Bertels and Fahle (2006) modelled a HHC problem with the objec- Tanoumand and Ünlüyurt (2021) addressed a HHC routing problem with scarce resources, where the objective is total transportation cost. The authors proposed a branch-and-price algorithm to solve the HHC routing problem.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In order to obtain a good solution in a short time, most scholars use heuristic algorithms to solve this type of problem, such as HGA, MA, LNS, and so on. Recently, some scholars also have been designing exact algorithms to solve HHC routing and scheduling problem, such as Yuan et al (2015), Liu et al (2017b), Tanoumand and Ünlüyurt (2021), Yuan et al (2018). Compared with heuristic approaches, exact algorithms will use more time when solving same problem.…”

Section: Literature Reviewmentioning

confidence: 99%

An ACO-based heuristic approach for a route and speed optimization problem in home health care with synchronized visits and carbon emissions

2021

View full text Add to dashboard Cite

The growing concern about the influences of anthropogenic pollutions has forced researchers and scholars to study the environmental concerns. This paper addresses a joint daily route and speed optimization problem in home health care (HHC) with the constraints of synchronized visits and carbon emissions. In this work, the aim is to design a reasonable logistics route with the objective of minimizing the carbon emissions, which has a linear relationship with fuel consumption. This goal can reduce environmental pollution while optimizing operating costs for the HHC company. This paper formulated the problem as a mixed-integer programming (MIP) model and used the Gurobi solver to solve the MIP model with a time limit of 1 h. However, the method based on the MIP model is difficult to solve large-scale instances. Therefore, this paper proposed an ant colony optimization (ACO)-based heuristic approach improved by local search for this problem with large-scale instances. The minimal carbon emissions of each route is calculated by a dynamic programming (DM) algorithm. We designed three kinds of experiments to test the proposed approach, including the basic vehicle routing problem with time window (VRPTW), the studied problem with one speed and the studied problem with two speeds. The experimental results highlight the effectiveness and efficiency of the proposed approach. KeywordsHome health care • Synchronized visits • Carbon emissions • ACO-based heuristic • Dynamic programming

show abstract

Schedule and Routing in Home Healthcare System Using Clustering Analysis and Multi-objective Optimization

Küçükdeniz,

Develioğlu

2023

The Springer Series in Applied Machine Learning

View full text Add to dashboard Cite

An exact algorithm for the resource constrained home health care vehicle routing problem

Cited by 16 publications

References 33 publications

Tabu Search with Variable Neighborhood Search Algorithm for Home Healthcare Routing Problem for Multiple Hospitals with Balanced Workload

Tabu Search with Variable Neighborhood Search Algorithm for Home Healthcare Routing Problem for Multiple Hospitals with Balanced Workload

An ACO-based heuristic approach for a route and speed optimization problem in home health care with synchronized visits and carbon emissions

Schedule and Routing in Home Healthcare System Using Clustering Analysis and Multi-objective Optimization

Contact Info

Product

Resources

About