Home health care routing and scheduling: A review

Fikar, Christian; Hirsch, Patrick

doi:10.1016/j.cor.2016.07.019

Cited by 342 publications

(222 citation statements)

References 55 publications

Supporting

Mentioning

212

Contrasting

Unclassified

Order By: Relevance

“…Here, we consider the problem of scheduling nurses and care workers to visit and provide care services to patients in their homes. Works in the literature tackling home healthcare planning problems usually use data from real-world scenarios Fikar and Hirsch (2017). This is also the case in the present work.…”

Section: Introductionmentioning

confidence: 76%

Using Goal Programming on Estimated Pareto Fronts to Solve Multiobjective Problems

Pinheiro

Landa-Silva

Laesanklang

et al. 2018

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems

View full text Add to dashboard Cite

Abstract:Modern multiobjective algorithms can be computationally inefficient in producing good approximation sets for highly constrained many-objective problems. Such problems are common in real-world applications where decision-makers need to assess multiple conflicting objectives. Also, different instances of real-world problems often share similar fitness landscapes because key parts of the data are the same across these instances. We we propose a novel methodology that consists of solving one instance of a given problem scenario using computationally expensive multiobjective algorithms to obtain a good approximation set and then using Goal Programming with efficient single-objective algorithms to solve other instances of the same problem scenario. We propose three goal-based objective functions and show that on a real-world home healthcare planning problem the methodology can produce improved results in a shorter computation time.

show abstract

Section: Introductionmentioning

confidence: 76%

Using Goal Programming on Estimated Pareto Fronts to Solve Multiobjective Problems

Pinheiro

Landa-Silva

Laesanklang

et al. 2018

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems

View full text Add to dashboard Cite

show abstract

“…The computational comparisons with the work of Hiermann et al [7] are a challenge [16], since the comparisons have been carried out based on our model and considerations for the HHCRSP. In order to investigate the efficiency of the proposed VND approach, the computational results will be compared with the VNS-VND embedded in the three dynamic neighbourhood strategies proposed by Hiermann et al [7].…”

Section: Computational Resultsmentioning

confidence: 99%

“…In both of the mathematical models stated above, no synchronisation constraints exist. The objective of Hiermann et al [7] is to minimise the deviation of different constraints; however, computational comparison with this work is a challenging issue [16]. As in the Trautsamwieser and Hirsch [15] work, Hiermann et al [7] propose a two-step heuristic solution.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Constraint (15) ensures the characteristics of nurse-client match. Constraints (16) and (17) express a piecewise linear function of the deviation from the starting time of the activity. Constraint (18) determines the arriving times of nurses according to the starting time of the previous jobs, the travelling times based on the transportation mode, and the duration of the jobs.…”

Section: Problem Formulationmentioning

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

“…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%

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

Home health care routing and scheduling: A review

Cited by 342 publications

References 55 publications

Using Goal Programming on Estimated Pareto Fronts to Solve Multiobjective Problems

Using Goal Programming on Estimated Pareto Fronts to Solve Multiobjective Problems

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

Contact Info

Product

Resources

About