OR problems related to Home Health Care: A review of relevant routing and scheduling problems

Cisse, Mohamed Fatah; Yalçındağ, Semih; Kergosien, Yannick; Şahin, Evren; Lenté, Christophe; Matta, Andrea

doi:10.1016/j.orhc.2017.06.001

Cited by 167 publications

(146 citation statements)

References 80 publications

Supporting

Mentioning

125

Contrasting

Unclassified

Order By: Relevance

“…The proposed algorithm is then run on the series of generated large-scale instances. As stated in Cissé, Yalçındağ, Kergosien, Şahin, Lenté and Matta [27], there is no benchmark instance in the literature: all the published papers have used different models and different instances. In this study, we modified the VNS solution approach of Hiermann et al [7] to solve our instances and compare them with the proposed solution approach.…”

Section: Computational Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A Two-Stage Solution Approach for the Large-Scale Home Healthcare Routeing and Scheduling Problem

Erdem¹,

Bulkan

2017

SAJIE

View full text Add to dashboard Cite

The purpose of this study is to introduce a two-stage solution approach for a large-scale home healthcare routeing and scheduling problem (HHCRSP). In the first part of the two-stage solution approach, a cluster-assign algorithm is employed, based on the home location and the time to obtain feasible clusters. In the second stage, using these clusters, route construction heuristics start to create schedules and routes, taking the side constraints of the model into consideration. Using the novelty of this two-stage solution approach, higher diversification is achieved with a series of newly-developed cross movement strategies. The computational results show that our solution approach offers certain advantages, such as an increase in the efficient use of human resources, and a decrease in the working time of nurses. OPSOMMINGDie doel van hierdie studie is om ŉ tweeledige oplossingsbenadering vir grootskaalse tuissorg roetebeplanning en skedulering voor te stel vir gesondheidsorg. In die eerste deel van die benadering word ŉ groepering-algoritme, gebaseer op die ligging van die tuiste en die tyd om vatbare groepe te vorm, toegepas. Tydens die tweede stap van die benadering word die groepe gebruik saam met roetebeplanning-heuristiek om skedules en roetes te skep terwyl die randvoor-waardes van die model in ag geneem word. Die tweeledige benadering bewerkstellig hoër diversifikasie met ŉ reeks nuut ontwikkelde kruisbeweging strategieë. Die gesimuleerde resultate toon dat die voorgestelde oplossingsbenadering sekere voordele inhou, onder andere die ŉ verhoging in die effektiewe aanwending van menslikehulpbronne en ŉ afname in die werktyd van verpleegsters.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

“…The idle times of 138 nurses are computed via constraints (19) and (20) (22) is a non-negativity constraint. Constraints (23) to (27) set the domains of the decision variables. …”

Section: Problem Formulationmentioning

confidence: 99%

A Two-Stage Solution Approach for the Large-Scale Home Healthcare Routeing and Scheduling Problem

Erdem¹,

Bulkan

2017

SAJIE

View full text Add to dashboard Cite

show abstract

“…The HCSRP has been considered in the mid-(e.g., a week) or short-term (e.g., a day) planning horizons [12,13]. Therefore, this section reviews the HCSRP from two planning horizons.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Constraints (9) to (12) are used to calculate the starting service and arrival times of caregivers, where M is a considerably large positive constant. Constraints (13) impose that the critical nodes are the first ones to be visited along routes. Constraints (14) describe the relationship between decision variables x * ijk and y * ik .…”

Section: Problem Descriptionmentioning

confidence: 99%

Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem

Yuan

Jiang

2017

Sustainability

View full text Add to dashboard Cite

Abstract:The aggravating trend of the aging population, the miniaturization of the family structure, and the increase of families with empty nesters greatly affect the sustainable development of the national economy and social old-age security system of China. The emergence of home health care or home care (HHC/HC) service mode provides an alternative for elderly care. How to develop and apply this new mobile service mode is crucial for the government. Therefore, the pertinent optimization problems regarding HHC/HC have constantly attracted the attention of researchers. Unexpected events, such as new requests of customers, cancellations of customers' services, and changes of customers' time windows, may occur during the process of executing an a priori visiting plan. These events may sometimes make the original plan non-optimal or even infeasible. To cope with this situation, we introduce disruption management to the real-time home caregiver scheduling and routing problem. The deviation measurements on customers, caregivers, and companies are first defined. A mathematical model that minimizes the weighted sum of deviation measurements is then constructed. Next, a tabu search (TS) heuristic is developed to efficiently solve the problem, and a cost recorded mechanism is used to strengthen the performance. Finally, by performing computational experiments on three real-life instances, the effectiveness of the TS heuristic is tested, and the advantages of disruption management are analyzed.

show abstract

“…At this stage, the numerical results were given for only four caregivers and 10 patients.Since then, many other studies were carried out, and they are classified in this paper according to: (1) optimization criterion, (2) constraints, and (3) solution approaches. For a more exhaustive review, see for instance [11,12]. Table 1 provides a classification of the main types of tackled objectives.…”

mentioning

confidence: 99%

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

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

OR problems related to Home Health Care: A review of relevant routing and scheduling problems

Cited by 167 publications

References 80 publications

A Two-Stage Solution Approach for the Large-Scale Home Healthcare Routeing and Scheduling Problem

A Two-Stage Solution Approach for the Large-Scale Home Healthcare Routeing and Scheduling Problem

Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem

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

Contact Info

Product

Resources

About