2017
DOI: 10.3390/su9020253
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows

Abstract: Abstract:As a new service model, home health care can provide effective health care by adopting door-to-door service. The reasonable arrangements for nurses and their routes not only can reduce medical expenses, but also can enhance patient satisfaction. This research focuses on the home health care scheduling optimization problem with known demands and service capabilities. Aimed at minimizing the total cost, an integer programming model was built in this study, which took both the priorities of patients and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(23 citation statements)
references
References 82 publications
0
22
0
1
Order By: Relevance
“…A home healthcare scheduling multiobjective optimization problem was considered to improve the patients' satisfaction [16]. Again, GA was utilized to solve the multiobjective optimization with objectives travel cost, service cost and penalty cost.…”
Section: Evolutionary Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…A home healthcare scheduling multiobjective optimization problem was considered to improve the patients' satisfaction [16]. Again, GA was utilized to solve the multiobjective optimization with objectives travel cost, service cost and penalty cost.…”
Section: Evolutionary Optimizationmentioning
confidence: 99%
“…Three kinds of optimization algorithms, evolutionary [8][9][10][11][12][13][14][15][16][17], stochastic [18][19][20][21][22][23][24][25][26][27][28][29] and combinatorial optimization [30][31][32][33][34][35][36][37][38] will be addressed. For machine learning algorithms, the discussion is based on un-supervised learning [39][40][41][42][43][44][45][46][47][48][49], supervised learning and semi-supervised learning [71][72][73][74][75][76][77][78]…”
Section: Introductionmentioning
confidence: 99%
“…The authors also compared the performance of this two-stage approach using the Kernel regression method with joint assignment and routing solution methods. Du et al [32] studied an HHC scheduling problem considering patients' priorities and time windows constraints. The authors proposed a solution algorithm which combines genetic algorithm (GA) with local search to solve large-scale problems.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Yuan et al [29] devise a B & P algorithm for the HCSRP with stochastic service times and skill requirements. Du et al [5] propose the genetic algorithm to solve the HCSRP when considering patients' priorities and time windows. Liu et al [10] construct the model of the HCSRP with lunch break requirements and caregiver-customer compatibility, and develop a B & P algorithm to exactly solve the problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (5) guarantee that each customer is visited by a caregiver exactly once. Constraints (6) to (8) ensure that each caregiver starts at node 0, visits some nodes, and finishes at node n + 1.…”
Section: Problem Descriptionmentioning
confidence: 99%