2018
DOI: 10.1007/978-3-319-93488-4_35
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm for Efficient and Sustainable Home Health Care Delivery Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…2.2 Solution approaches to the home health care routing and scheduling problem Greedy heuristics, metaheuristics and decomposition approaches such as branch and price (B&P) and BD are by far the most commonly used strategies adopted when addressing the HHCRSP (Ciss e et al, 2017;Fikar and Hirsch, 2016;Castillo-Salazar et al, 2012;Grenouilleau et al, 2020). In general, the heuristic algorithmic approaches are used for designing routes rapidly when planners face up to a given context in which the HHCRSP is difficult to solve (Szander et al, 2019;Nickel et al, 2012). Within this category, the work performed by Begur et al (1997) is recognized as one of the first attempts to optimize the HHCRSP; in their work, the authors proposed the adoption of a sequential savings algorithm, where long-term planning horizons were considered.…”
Section: Related Research Workmentioning
confidence: 99%
“…2.2 Solution approaches to the home health care routing and scheduling problem Greedy heuristics, metaheuristics and decomposition approaches such as branch and price (B&P) and BD are by far the most commonly used strategies adopted when addressing the HHCRSP (Ciss e et al, 2017;Fikar and Hirsch, 2016;Castillo-Salazar et al, 2012;Grenouilleau et al, 2020). In general, the heuristic algorithmic approaches are used for designing routes rapidly when planners face up to a given context in which the HHCRSP is difficult to solve (Szander et al, 2019;Nickel et al, 2012). Within this category, the work performed by Begur et al (1997) is recognized as one of the first attempts to optimize the HHCRSP; in their work, the authors proposed the adoption of a sequential savings algorithm, where long-term planning horizons were considered.…”
Section: Related Research Workmentioning
confidence: 99%
“…The algorithm Tabu Search (TS) is largely used for solving the HHCSRP, Hertz and Lahrichi [10] consider the deterministic patients to caregivers assignment for HHC service by using TS. A daily planning generation using public transport [11], a periodic home health care logistics [12] [13], a sustainable delivery scheduling [14], a robust planning model considering the temporal uncertainty [15], a real-time scheduling problem with the disruption management [16] are solved by TS with the good performance. Moreover, Simulated Annealing (SA) is widely used for approximate solution generation in HHCSRP, such as an interdependent services based scheduling problem [17], a bi-objective green routing problem [18], a simultaneous delivery and pick-up problem [19], a workforce scheduling problem [20], a multimodal scheduling problem [21].…”
Section: A Solution Approch Of Hhcsrpmentioning
confidence: 99%
“…The data employed to develop the Results Section in the paper were provided by the Care Centre for the Elderly (CCE). In 2017 and 2018 [22,23], the authors published particular cases or simplifications of the work herein included. Those cases made a comparison among various transport systems by making patient satisfaction a priority.…”
Section: Introductionmentioning
confidence: 99%