Daily scheduling of home health care services using time-dependent public transport

Flexible Services and Manufacturing Journal

Volumn 28, Issue 3, 2016, Pages 495-525

  Rest, Klaus Dieter ^a   Hirsch, Patrick ^a  

^a UNIVERSITY OF NATURAL RESOURCES AND LIFE SCIENCES   (Austria)

Author keywords

Home health care; Multimodal routing; Tabu search; Time dependent travel times

Indexed keywords

HEALTH CARE; MASS TRANSPORTATION; NUMERICAL METHODS; OPTIMIZATION; SCHEDULING; TABU SEARCH; TRANSPORTATION; TRAVEL TIME; TROLLEY CARS;

DAILY SCHEDULING; MODEL FORMULATION; MULTI-MODAL; PUBLIC TRANSPORT SERVICE; REAL-WORLD OPTIMIZATION; SCHEDULING PROBLEM; SOLUTION METHODS; TIME DEPENDENT;

HOME HEALTH CARE;

EID: 84944580146     PISSN: 19366582     EISSN: 19366590     Source Type: Journal    
DOI: 10.1007/s10696-015-9227-1     Document Type: Article

References (36)

1. Akjiratikarl C, Yenradee P, Drake PR (2007) Pso-based algorithm for home care worker scheduling in the UK. Comput Ind Eng 53(4):559–583. doi:10.1016/j.cie.2007.06.002
2. Begur SV, Miller DM, Weaver JR (1997) An integrated spatial dss for scheduling and routing home-health-care nurses. Interfaces 27(4):35–48. doi:10.1287/inte.27.4.35
3. Bertels S, Fahle T (2006) A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput Oper Res 33(10):2866–2890. doi:10.1016/j.cor.2005.01.015
4. Bräysy O, Dullaert W, Nakari P (2009) The potential of optimization in communal routing problems: case studies from Finland. J Transp Geogr 17(6):484–490. doi:10.1016/j.jtrangeo.2008.10.003
5. Bredström D, Rönnqvist M (2007) A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. Discussion Paper No. 2007/7, NHH Department of Finance and Management Science, Norwegian School of Economics, Norway, doi:10.2139/ssrn.971726
6. Bredström D, Rönnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191(1):19–31. doi:10.1016/j.ejor.2007.07.033
7. Cappanera P, Scutellà MG (2014) Joint assignment, scheduling and routing models to home care optimization: a pattern based approach. Transp Sci 1–23. doi:10.1287/trsc.2014.0548
8. Chabini I, Dean B (1999) Shortest path problems in discrete-time dynamic networks: Complexity, algorithms, and implementations. Tech. rep, Massachusetts Institute of Technology, Cambridge, MA
9. Cheng E, Rich JL (1998) A home health care routing and scheduling problem. Tech. rep. tr98-04, Department of CAAM, Rice University, Houston Texas, USA
10. Cordeau JF, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res B 37(6):579–594. doi:10.1016/S0191-2615(02)00045-0
11. Cordeau JF, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52(8):928–936
12. Dabia S, Ropke S, Van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transp Sci 47(3):380–396. doi:10.1287/trsc.1120.0445
13. Dohn A, Rasmussen MS, Justesen T, Larsen J (2008) The home care crew scheduling problem. In: Sheibani K (ed) Proceedings of the 1st international conference on applied operational (ICAOR’08), Yerevan, Armenia, Lecture Notes in Management Science, vol 1, pp 1–8
14. Ehmke JF, Steinert A, Mattfeld DC (2012) Advanced routing for city logistics service providers based on time-dependent travel times. J Comput Sci 3(4):193–205. doi:10.1016/j.jocs.2012.01.006
15. Elbenani B, Ferland J, Gascon V (2008) Mathematical programming approach for routing home care nurses. In: Proceedings of industrial engineering and engineering management 2008 (IEEM08), Singapore, pp 107–111, doi:10.1109/IEEM.2008.4737841
16. Eveborn P, Flisberg P, Rönnqvist M (2006) Laps care-an operational system for staff planning of home care. Eur J Oper Res 171(3):962–976. doi:10.1016/j.ejor.2005.01.011
17. Eveborn P, Rönnqvist M, Einarsdóttir H, Eklund M, Lidén K, Almroth M (2009) Operations research improves quality and efficiency in home care. Interfaces 39(1):18–34. doi:10.1287/inte.1080.0411
18. Fikar C, Hirsch P (2014) A matheuristic for routing real-world home service transport systems facilitating walking. J Clean Prod. doi:10.1016/j.jclepro.2014.07.013
19. Fleischmann B, Gietz M, Gnutzmann S (2004) Time-varying travel times in vehicle routing. Transp Sci 38(2):160–173. doi:10.1287/trsc.1030.0062
20. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533–549. doi:10.1016/0305-0548(86)90048-1
21. Glover F, Laguna M, Marti R (2007) Principles of tabu search. In: Gonzalez TF (ed) Handbook of approximation algorithms and metaheuristics. Chapman & Hall/CRC, Boca Raton, pp 23-1–23-11. doi:10.1201/9781420010749
22. Hiermann G, Prandtstetter M, Rendl A, Puchinger J, Raidl GR (2013) Metaheuristics for solving a multimodal home-healthcare scheduling problem. Cent Eur J Oper Res 23:1–25. doi:10.1007/s10100-013-0305-8
23. Hill AV, Benton WC (1992) Modelling intra-city time-dependent travel speeds for vehicle scheduling problems. J Oper Res Soc 43(4):343–351. doi:10.2307/2583157
24. Hirsch P (2011) Minimizing empty truck loads in round timber transport with tabu search strategies. Int J Inf Syst Supply Chain Manag 4(2):15–41. doi:10.4018/jisscm.2011040102
25. Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379–396. doi:10.1016/S0377-2217(02)00147-9
26. Klunder G, Post H (2006) The shortest path problem on large-scale real-road networks. Networks 48(4):182–194. doi:10.1002/net.20131
27. Kritzinger S, Tricoire F, Dörner KF, Hartl RF (2011) Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows. In: Coello CAC (ed) Proceedings of the 5th international conference on learning and intelligent optimization (LION’05), Rome, Italy, Lecture Notes in Computer Science, vol 6683, pp 61–75
28. Liu R, Xie X, Garaix T (2014) Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics. Omega 47:17–32. doi:10.1016/j.omega.2014.03.003
29. Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp Sci 26(3):185–200. doi:10.1287/trsc.26.3.185
30. Mankowska DS, Meisel F, Bierwirth C (2013) The home health care routing and scheduling problem with interdependent services. Health Care Manag Sci 17(1):15–30. doi:10.1007/s10729-013-9243-1
31. Matta A, Chahed S, Sahin E, Dallery Y (2014) Modelling home care organisations from an operations management perspective. Flex Serv Manuf J 26(3):295–319. doi:10.1007/s10696-012-9157-0
32. Rasmussen MS, Justesen T, Dohn A, Larsen J (2012) The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur J Oper Res 219(3):598–610. doi:10.1016/j.ejor.2011.10.048
33. Rest KD, Trautsamwieser A, Hirsch P (2012) Trends and risks in home health care. J Humanit Logist Supply Chain Manag 2(1):34–53. doi:10.1108/20426741211225993
34. Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4(2):146–154. doi:10.1287/ijoc.4.2.146
35. Trautsamwieser A, Hirsch P (2014) A branch-price-and-cut approach for solving the medium-term home health care planning problem. Networks 64(3):143–159. doi:10.1002/net.21566
36. Trautsamwieser A, Gronalt M, Hirsch P (2011) Securing home health care in times of natural disasters. OR Spectr 33(3):787–813. doi:10.1007/s00291-011-0253-4