Stochastic and Periodic Resource Scheduling Problem in Home Health Care

doi:10.3969/j.issn.1007-7375.e15-1563

Abstract

Abstract: Home health care is an emerging service industry. To meet the requirement of stochastic and periodic home health care and solve the resource scheduling problem in the stochastic and periodic service process, a resource scheduling model is established. The aim of this research is to schedule the service sequence and routes of the next period with the minimal resource cost (for example, service personnel), under the circumstance of the stochastics of the service date. The solution is to use the Monte Carlo simulation to find the best solution which is correspondent to reality by a reasonable Tabu search algorithm. By doing computational experiments within different scales, the validity of this algorithm is verified.

Key words: HHC, reriodic, stochastic, VRP, tabu search, Monte Carlo simulation

CLC Number:

TP301.6

WU Meng, LIU Ran, JIANG Zhibin, WANG Xuefeng. Stochastic and Periodic Resource Scheduling Problem in Home Health Care[J]. Industrial Engineering Journal , 2017, 20(1): 51-58.

References

[1] LANZARONE E, MATTA A, SAHIN E. Operations management applied to home care services:the problem of assigning human resources to patients[J]. Systems, Man and Cybernetics, Part A:Systems and Humans, IEEE Transactions on, 2012, 42(6):1346-1363.
[2] EVEBORN P, FLISBERG P, RONNQVIST M. Laps Care-an operational system for staff planning of home care[J]. European Journal of Operational Research, 2006, 171(3):962-976.
[3] LIU R, XIE X, AUGUSTO V, et al. Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care[J]. European Journal of Operational Research, 2013, 230(3):475-486.
[4] STEEG J, SCHRODER M. A hybrid approach to solve the periodic home health care problem[M]//Operations Research Proceedings 2007. Springer Berlin Heidelberg, 2008:297-302.
[5] JAUMARD B, SEMET F, VOVOR T. A generalized linear programming model for nurse scheduling[J]. European journal of operational research, 1998, 107(1):1-18.
[6] RASMUSSEN M S, JUSTESEN T, DOHN A, et al. The home care crew scheduling problem:Preference-based visit clustering and temporal dependencies[J]. European Journal of Operational Research, 2012, 219(3):598-610.
[7] MANKOWSKA D S, MEISEL F, BIERWIRTH C. The home health care routing and scheduling problem with interdependent services[J]. Health care management science, 2014, 17(1):15-30.
[8] KERGOSIEN Y, LENTE C, BILLAUT J C. Home health care problem:An extended multiple traveling salesman problem[C]//Proceedings of the 4th Multidisciplinary International Conference on Scheduling:Theory and Applications Dublin MISTA, 2009:85-92.
[9] BORNE H A S, LETOCART L, CALVO R W. A matheuristic approach for solving a home health care problem[C]//International Network Optimization Conference. 2013.
[10] BELTRAMI E J, BODIN L D. Networks and vehicle routing for municipal waste collection[J]. Networks, 1974, 4(1):65-94.
[11] RUSSLL R, IGO W. An assignment routing problem[J]. Networks, 1979, 9(1):1-17.
[12] CORDEAU J F, GENDREAU M, LAPORTE G. A tabu search heuristic for periodic and multi-depot vehicle routing problems[J]. Networks, 1997, 30(2):105-119.
[13] HEMMELMAYR V C, DOERNER K F, HARTL R F. A variable neighborhood search heuristic for periodic routing problems[J]. European Journal of Operational Research, 2009, 195(3):791-802.
[14] VIDAL T, CRAINIC T G, GENDREAU M, et al. A hybrid genetic algorithm for multidepot and periodic vehicle routing problems[J]. Operations Research, 2012, 60(3):611-624.
[15] GOLDEN B, ASSAD A, LEVY L, et al. The fleet size and mix vehicle routing problem[J]. Computers & Operations Research, 1984, 11(1):49-66.
[16] BIRATTARI M, BALAPRAKASH P, STUTZLE T, et al. Estimation-based local search for stochastic combinatorial optimization using delta evaluations:a case study on the probabilistic traveling salesman problem[J]. INFORMS Journal on Computing, 2008, 20(4):644-658.