Managing Home Healthcare System Using Capacitated Vehicle Routing Problem with Time Windows: A Case Study in Chiang Mai, Thailand

Background: The Vehicle Routing Problem with Time Windows (VRPTW) has been extensively researched due to its applicability across various real-world domains, including logistics, healthcare, and distribution systems. With the global elderly population projected to continue increasing, the demand for home healthcare (HHC) services is also on the rise. This work focuses on a specific application within an HHC system, aiming to minimize the total completion time for a fleet of vehicles delivering healthcare services to patients at home. Methods: We propose a mathematical model for the VRPTW, targeting a reduction in both customer and server waiting times on each route and seeking to decrease the total completion time. Our proposed algorithm employs a tabu search to narrow the search space, leveraging a greedy algorithm to establish the tabu list. Results: Our experimental results, based on Solomon’s benchmark datasets, demonstrate that the proposed algorithms achieve optimal solutions, particularly in minimizing total completion time compared to traditional methods, in a case study involving 400 customers where vehicles’ hours are restricted to align with caregivers’ average daily working hours. Conclusions: Our algorithm resulted in a 59% reduction in the number of vehicles required compared to the most recent algorithms, which combine k-mean clustering and local search.