Paper Info
Title
Home health care crew scheduling and routing problem with stochastic service times
Abstract
The home health care crew scheduling and routing problem with stochastic service times is studied in this paper. A stochastic programming model with recourse is constructed to describe the problem. The approximate formulation for the expected penalty for late arrival at a customer is obtained and analyzed. According to its features, the problem is transformed into a classical set partitioning problem (SPP) and an elementary shortest path problem with resource constraints (ESPPRC). The SPP is solved by the column generation algorithm, and the ESPPRC is solved by an effective label algorithm. To get integer feasible solutions, the column generation procedure is embedded within a branch and bound framework, which is also called branch and price approach. Its effectiveness is validated by the numerical experiment.
Year
DOI
Venue
2014
10.1109/CoASE.2014.6899382
CASE
Keywords
Field
DocType
health care,scheduling,routing problem,tree searching,effective label algorithm,stochastic service times,branch and price,set theory,constraint theory,resource allocation,espprc,stochastic programming model,home health care,elementary shortest path problem with resource constraints,set partitioning problem,branch and bound technique,home health care crew scheduling,column generation algorithm,scheduling and routing,branch and price approach,stochastic programming,spp,stochastic processes,routing,pricing,algorithm design and analysis
Column generation,Mathematical optimization,Branch and bound,Algorithm design,Shortest path problem,Computer science,Branch and price,Crew scheduling,Stochastic process,Stochastic programming
Conference
Citations 
PageRank 
References 
0
0.34
9
Authors
3
Name
Order
Citations
PageRank
Biao Yuan1143.58
Ran Liu2417.64
Z. B. Jiang324236.08