A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements

被引:107
作者
Yuan, Biao [1 ]
Liu, Ran [1 ]
Jiang, Zhibin [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Ind Engn & Management, Shanghai 200030, Peoples R China
基金
中国国家自然科学基金; 高等学校博士学科点专项科研基金;
关键词
home health care; stochastic service times; skill requirements; column generation; branch-and-price; vehicle routing; TRAVEL; WINDOWS; SEARCH;
D O I
10.1080/00207543.2015.1082041
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Home health care (HHC) is defined as providing medical and paramedical services for patients at their own domicile. In the HHC industry, it is crucial for health care organisations to assign caregivers to patients and devise reasonable visiting routes to save total operational cost and improve the service quality. However, some special constraints make the problem hard to solve. For example, patients' service times are usually stochastic due to their varying health conditions; caregivers are organised in a hierarchical structure according to their skills to satisfy patients' demands. In this paper, we address a HHC scheduling and routing problem with stochastic service times and skill requirements. A stochastic programming model with recourse is proposed to formulate the problem in which the expected penalty for late arrival at customers is considered. To solve the problem, it is equivalently transformed into a master problem and a pricing sub-problem. A column generation algorithm is developed to solve the relaxation of the master problem and obtain its lower bound. A label algorithm and several effective accelerating techniques are devised to solve the pricing sub-problem. To obtain feasible solutions, the column generation procedure is embedded within the branch and bound framework. The effectiveness of the proposed algorithm is validated through numerical experiments.
引用
收藏
页码:7450 / 7464
页数:15
相关论文
共 31 条
  • [1] PSO-based algorithm for home care worker scheduling in the UK
    Akjiratikarl, Chananes
    Yenradee, Pisal
    Drake, Paul R.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (04) : 559 - 583
  • [2] A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
    Bertels, S
    Fahle, T
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (10) : 2866 - 2890
  • [3] Accelerated label setting algorithms for the elementary resource constrained shortest path problem
    Boland, N
    Dethridge, J
    Dumitrescu, I
    [J]. OPERATIONS RESEARCH LETTERS, 2006, 34 (01) : 58 - 68
  • [4] Chen D, 2010, APPL INTEGER PROGRAM
  • [5] Desrosiers J., 2005, Column generation, P1, DOI [10.1007/0-387-25486-2_1, DOI 10.1007/0-387-25486-2_1, 10.1007/0-387-25486-2]
  • [6] Di Mascolo Maria., 2014, INT C HLTH CARE SYST, P73
  • [7] LAPS CARE -: an operational system for staff planning of home care
    Eveborn, P
    Flisberg, P
    Rönnqvist, M
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (03) : 962 - 976
  • [8] An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
    Feillet, D
    Dejax, P
    Gendreau, M
    Gueguen, C
    [J]. NETWORKS, 2004, 44 (03) : 216 - 229
  • [9] A tutorial on column generation and branch-and-price for vehicle routing problems
    Feillet, Dominique
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2010, 8 (04): : 407 - 424
  • [10] A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
    Gutierrez-Jarpa, Gabriel
    Desaulniers, Guy
    Laporte, Gilbert
    Marianov, Vladimir
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) : 341 - 349