A branch-price-and-cut approach for solving the medium-term home health care planning problem

Networks

Volumn 64, Issue 3, 2014, Pages 143-159

  Trautsamwieser, Andrea ^a   Hirsch, Patrick ^a  

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

Author keywords

Branch Price and Cut; Home health care; Variable neighborhood search; Vehicle routing; Weekly planning horizon

Indexed keywords

DECISION SUPPORT SYSTEMS; NURSING; OPTIMIZATION; VEHICLE ROUTING;

BRANCH-PRICE-AND-CUT; DECISION SUPPORTS; INDUSTRIAL COUNTRIES; PLANNING HORIZONS; SOLUTION APPROACH; TEST INSTANCES; TIME-CONSUMING TASKS; VARIABLE NEIGHBORHOOD SEARCH;

HOME HEALTH CARE;

EID: 84912562704     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21566     Document Type: Article

References (33)

1. C. Akjiratikarl, P. Yenradee, and P.R. Drake, PSO-based algorithm for home care worker scheduling in the UK, Comput Ind Eng 53 (2007), 559-583.
2. S.V. Begur, D.M. Miller, and J.R. Weaver, An integrated spatial DSS for scheduling and routing home-health-care nurses, Interfaces 27 (1997), 35-48.
3. S. Bertels and T. Fahle, A hybrid setup for a hybrid scenario: Combining heuristics for the home health care problem, Comput Oper Res 33 (2006), 2866-2890.
4. A. Bettinelli, A. Ceselli, and G. Righini, A branch-andcut- and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows, Transp Res Part C 19 (2011), 723-740.
5. O. Bräysy, W. Dullaert, and N. Pentti, "Municipal routing problems: A challenge for researchers and policy makers?" Bijdragen Vervoerslogistieke Werkdagen 2007, Nautilus Academic Books, Zelzate, Belgium, 2007, pp. 330-347.
6. D. Bredström and M. Rönnqvist, A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints, Technical Report 7, NHH Department of Finance & Management Science, Norwegian School of Economics, Norway, 2007.
7. D. Bredström and M. Rönnqvist, Combined vehicle routing and scheduling with temporal precedence and synchronization constraints, Eur J Oper Res 191 (2008), 19-31.
8. M. Cattafi, R. Herrero, M. Gavanelli, M. Nonato, and F. Malucelli, Improving quality and efficiency in home health care: An application of constraint logic programming for the Ferrara NHS unit, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), A Dovier and VS Costa, (Editors), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 17, 2012, pp. 415-424.
9. A. Ceselli, G. Righini, and M. Salani, A column generation algorithm for a rich vehicle-routing problem, Transp Sci 43 (2009), 56-69.
10. A. Chabrier, Vehicle routing problem with elementary shortest path based column generation, Comput Oper Res 33 (2006), 2972-2990.
11. E. Cheng and J.L. Rich, A home health care routing and scheduling problem, Technical Report TR98-04, Department of CAAM, Rice University, Houston Texas, 1998.
12. G.B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Oper Res 8 (1960), 101-111.
13. A. Dohn, M.S. Rasmussen, T. Justesen, and J. Larsen, The home care crew scheduling problem, Proc 1st Int Conf Appl Oper Res (ICAOR'08), K. Sheibani (Editor),Yerevan, Armenia, Lecture Notes in Management Science, Vol. 1, 2008, pp. 1-8.
14. M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Oper Res 42 (1994), 977-978.
15. P. Eveborn, P. Flisberg, and M. Rönnqvist, Laps Care-An operational system for staff planning of home care, Eur J Oper Res 171 (2006), 962-976.
16. P. Eveborn, M. Rönnqvist, H. Einarsdóttir, M. Eklund, K. Lidén, and M. Almroth, Operations research improves quality and efficiency in home care, Interfaces 39 (2009), 18-34.
17. D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks 44 (2004), 216-229.
18. M. Gamst and T.S. Jensen, A branch-and-price algorithm for the long-term home care scheduling problem, Oper Res Proc, D. Klatte, H.J. Lüthi, and K. Schmedders (Editors), Springer, 2012, pp. 483-488.
19. P. Hansen and N. Mladenović,Variable neighborhood search: Principles and applications, Eur J Oper Res 130 (2001), 449-467.
20. S. Irnich and G. Desaulniers, "Shortest path problems with resource constraints," Column Generation, G. Desaulniers and J. Desrosiers, and M.M. Solomon (Editors), Springer, US, 2005, pp. 33-65.
21. T. Justesen and M.S. Rasmussen, The home care crew scheduling problem, Master's thesis, Technical University of Denmark and University of Copenhagen, Copenhagen, 2008.
22. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983), 671-680.
23. N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis, 2Path cuts for the vehicle routing problem with time windows, Transp Sci 33 (1999), 101-116.
24. R. Lougee-Heimer, The common optimization interface for operations research, IBM J Res Dev 47 (2003), 57-66.
25. S. Nickel, M. Schröder, and J. Steeg, Mid-term and shortterm planning support for home health care services, Eur J Oper Res 219 (2012), 574-587.
26. M.S. Rasmussen, T. Justesen, and A. Dohn, The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies, Eur J Oper Res 219 (2012), 598-610.
27. A. Rendl, M. Prandstetter, G. Hiermann, J. Puchinger, and G.R. Raidl, Hybrid heuristics for multimodal homecare scheduling, CPAIOR, Nantes, France, 2012, pp. 339-355.
28. K.D. Rest and P. Hirsch, A tabu search approach for daily scheduling of home health care services using multi-modal transport, Proc 5th Int Workshop Freight Transp Logist, Odysseus, 2012, pp. 373-376.
29. K.D. Rest, A. Trautsamwieser, and P. Hirsch, Trends and risk in home health care, J Humanitarian Logist Supply Chain Manage 2 (2012), 34-53.
30. G. Righini and M. Salani, Symmetry helps: Bounded bidirectional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optim 3 (2006), 255-273.
31. M. Savelsbergh, The vehicle routing problem with time windows: Minimizing route duration, INFORMS J Comput 4 (1992), 146-154.
32. J.G. Siek, L.Q. Lee, and A. Lumsdaine, The Boost Graph Library: User Guide and Reference Manual, Addison-Wesley Professional, Indianapolis, Indiana, 2002.
33. A. Trautsamwieser, M. Gronalt, and P. Hirsch, Securing home health care in times of natural disasters, OR Spectrum 33 (2011), 787-813.