Operations management in the home care services: a heuristic for the caregivers’ routing problem

Redjem, Rabeh; Marcon, Eric

doi:10.1007/s10696-015-9220-8

Cited by 69 publications

(32 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[8] X X X X X X X X X Hiermann and al. [9] X X X X X X X X Redjem and Marcon [10] X X X X X X X Du and al. [11] X X X X X X X X Depending on the mathematical nature of the variables characterizing the decisions, the solutions vary according to one or more criteria including the types of offer and the demand constraints that are allowed in the mathematical formulation of the HHCRSP.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Home Health Care Daily Planning Considering the Satisfaction of all the Stakeholders

Zhang

Bouchet

Lamine

et al. 2019

2019 International Conference on Industrial Engineering and Systems Management (IESM)

View full text Add to dashboard Cite

Nowadays, the aging population and the growth of life expectancy lead to an increase of people experiencing frailty and therefore loss of autonomy. As there are not enough places available in specialized institutions, an alternative is Home Health Care (HHC) services. The HHC structure is willing to optimize the scheduling of the requested care services by satisfying the requirements of patients, the preferences of caregivers, and by balancing the workload among the different caregivers. The purpose of this paper is to propose a metaheuristic-oriented formulation and a simulated annealing algorithm for generating an optimal short-term (daily) routing and scheduling solution to reach maximum satisfaction among stakeholders (patients and caregivers) in an HHC system. With this method computed on a real-world dataset, we obtained satisfying scheduling solutions.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The caregivers have a total of 5 different skills to accomplish the corresponding care services. Each of the 10 caregivers also have the 2 special parameters to compose the OF: = [50], =[6,10,15,20,30,45].…”

mentioning

confidence: 99%

Home Health Care Daily Planning Considering the Satisfaction of all the Stakeholders

Zhang

Bouchet

Lamine

et al. 2019

2019 International Conference on Industrial Engineering and Systems Management (IESM)

View full text Add to dashboard Cite

show abstract

“…They developed neighborhood search based efficient heuristic methods, capable of handling the synchronization requirements as well as large sized problems. Redjem and Marcon [30] proposed a heuristic method named as caregivers routing heuristic (CRH) to address the problem of caregivers routing. In first step, the heuristic method develops caregivers' routes based on the shortest travel time, while the second step integrates the sequencing and coordination constraints to satisfy all the problem assumptions.…”

Section: Literature Reviewmentioning

confidence: 99%

Solving a More Flexible Home Health Care Scheduling and Routing Problem with Joint Patient and Nursing Staff Selection

Nasir

Dang

2018

Sustainability

View full text Add to dashboard Cite

Development of an efficient and effective home health care (HHC) service system is a quite recent and challenging task for the HHC firms. This paper aims to develop an HHC service system in the perspective of long-term economic sustainability as well as operational efficiency. A more flexible mixed-integer linear programming (MILP) model is formulated by incorporating the dynamic arrival and departure of patients along with the selection of new patients and nursing staff. An integrated model is proposed that jointly addresses: (i) patient selection; (ii) nurse hiring; (iii) nurse to patient assignment; and (iv) scheduling and routing decisions in a daily HHC planning problem. The proposed model extends the HHC problem from conventional scheduling and routing issues to demand and capacity management aspects. It enables an HHC firm to solve the daily scheduling and routing problem considering existing patients and nursing staff in combination with the simultaneous selection of new patients and nurses, and optimizing the existing routes by including new patients and nurses. The model considers planning issues related to compatibility, time restrictions, contract durations, idle time and workload balance. Two heuristic methods are proposed to solve the model by exploiting the variable neighborhood search (VNS) approach. Results obtained from the heuristic methods are compared with a CPLEX based solution. Numerical experiments performed on different data sets, show the efficiency and effectiveness of the solution methods to handle the considered problem.

show abstract

“…Cont. [21] × × × [22] × × × [23] × × × [24] × × × × [25] × × × [26] × [27] × [28] × [29] × [30] × [31] × [32] × [33] × × [34] × × [35] × × [36] × × [37] × × × [38] × × [39] × × × [1] × × [40] × × [41] × × [42] × [43] × [44] × [45] × [46] × [47] × × × [48] × [49] × [50] × × × [51] × × × [52] × [53] × [54] × × × [55] × × [56] × [57] × As shown in the last table, the objective of minimizing traveling costs, waiting costs, or patient preferences is undoubtedly the most widespread in the literature. However, when multiple objective functions are handled, they are often considered within a single criterion as a weighted sum.…”

Section: Introductionmentioning

confidence: 99%

Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health CareServices

Haddadene¹,

Labadie

Prodhon

2019

Algorithms

View full text Add to dashboard Cite

Home Healthcare (HHC) is an emerging and fast-expanding service sector that gives rise to challenging vehicle routing and scheduling problems. Each day, HHC structures must schedule the visits of caregivers to patients requiring specific medical and paramedical services at home. These operations have the potential to be unsuitable if the visits are not planned correctly, leading hence to high logistics costs and/or deteriorated service level. In this article, this issue is modeled as a vehicle routing problem where a set of routes has to be built to visit patients asking for one or more specific service within a given time window and during a fixed service time. Each patient has a preference value associated with each available caregiver. The problem addressed in this paper considers two objectives to optimize simultaneously: minimize the caregivers' travel costs and maximize the patients' preferences. In this paper, different methods based on the bi-objective non-dominated sorting algorithm are proposed to solve the vehicle routing problem with time windows, preferences, and timing constraints. Numerical results are presented for instances with up to 73 clients. Metrics such as the distance measure, hyper-volume, and the number of non-dominated solutions in the Pareto front are used to assess the quality of the proposed approaches.Algorithms 2019, 12, 152 2 of 25 work (Ait Haddadene et al. [1]), the minimization of the traveling cost and the sum of non-preferences related to customers were considered as a single-objective function. The obtained results showed the conflicting nature of these criteria, which is why, we are particularly interested in solving the bi-objective version of VRPTW-SP.The problem at hand is an extension of the Vehicle Routing Problem (VRP), which is one of the most-studied combinatorial optimization problems. First introduced by Dantzig and Ramser [2], the aim of this NP-hard problem is to determine a set of minimal cost routes in which a set of customers is to be served by a fleet of vehicles based at a depot node. A detailed survey can be found in Toth and Vigo [3]. Currently, one of the most effective metaheuristics for the VRP is the hybrid genetic algorithm introduced by Vidal [4], which was latter generalized to solve more than 26 VRP variants.Among the different classes of VRP, the VRP with Time Windows (VRPTW) stands as the basis variant of our studied problem. Heuristic and metaheuristic approaches have been widely used to solve the VRPTW such as those proposed by Kindervater and Savelsbergh [5], Bräysy and Gendreau [6], Nagata [7], and Bräysy et al. [8]. In the field of healthcare, most problems are modeled as a VRPTW. In fact, the origin of vehicle routing problems in HHC systems may be linked to the door-to door-transportation of elderly or disabled persons (Dial A Ride Problems (DARP)) proposed by Bodin and Sexton [9]. A few years later, this variant was extended to the Home Healthcare (HHC) problem by Cheng and Rich [10], where caregivers are assigned to patient homes to pro...

show abstract

Operations management in the home care services: a heuristic for the caregivers’ routing problem

Cited by 69 publications

References 17 publications

Home Health Care Daily Planning Considering the Satisfaction of all the Stakeholders

Home Health Care Daily Planning Considering the Satisfaction of all the Stakeholders

Solving a More Flexible Home Health Care Scheduling and Routing Problem with Joint Patient and Nursing Staff Selection

Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health CareServices

Contact Info

Product

Resources

About