Stochastic home health care routing and scheduling problem with multiple synchronized services

被引:28
作者
Bazirha, Mohammed [1 ]
Kadrani, Abdeslam [1 ]
Benmansour, Rachid [1 ,2 ]
机构
[1] SI2M Lab INSEA, Rabat, Morocco
[2] LAMIH UMR CNRS 8201, Valenciennes, France
关键词
Variable neighborhood search; Genetic algorithm; Home health care; Routing and scheduling; Multiple synchronized services; Stochastic programming model with recourse; SOFT TIME WINDOWS; NEIGHBORHOOD SEARCH; TRAVEL; OPTIMIZATION; ALGORITHM; DEMANDS;
D O I
10.1007/s10479-021-04222-w
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The home health care (HHC) covers a wide range of health care services carried out in patients' home in case of illness, injury or aging. Each caregiver should as far as possible adhere to the schedule set by the decision maker. However, unforeseen events would sometimes occur and delay the delivery of care services, which will qualify the service as poor or even risky. Deterministic models ignore this uncertainty, which can arise at any time and will therefore lead to non-compliance with the predefined schedule. Furthermore, patients need several care activities per day, and some of them require to be simultaneous by their nature such as dressing, getting out of bed and bathing. In this work, a stochastic programming model with recourse (SPR model) is proposed to deal with the home health care routing and scheduling problem (HHCRSP) where uncertainties in terms of traveling and caring times that may occur as well as synchronization of services are considered. The objective is to minimize the transportation cost and the expected value of recourse, which is estimated using Monte Carlo simulation. The recourse is defined as a penalty cost for patients' delayed services and a remuneration for caregivers' extra working time. The deterministic model is solved by CPLEX, the genetic algorithm (GA) and the general variable neighborhood search (GVNS) based heuristics. The SPR model is solved by Monte Carlo simulation embedded into the GA. Computational results highlight the efficiency of GVNS and GA based heuristics and the complexity of the SPR model in terms of CPU running times.
引用
收藏
页码:573 / 601
页数:29
相关论文
共 42 条
[21]   Metaheuristics for solving a multimodal home-healthcare scheduling problem [J].
Hiermann, Gerhard ;
Prandtstetter, Matthias ;
Rendl, Andrea ;
Puchinger, Jakob ;
Raidl, Guenther R. .
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2015, 23 (01) :89-113
[22]   GENETIC ALGORITHMS [J].
HOLLAND, JH .
SCIENTIFIC AMERICAN, 1992, 267 (01) :66-72
[23]   Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands [J].
Juan, Angel A. ;
Faulin, Javier ;
Jorba, Josep ;
Caceres, Jose ;
Manuel Marques, Joan .
ANNALS OF OPERATIONS RESEARCH, 2013, 207 (01) :43-65
[24]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[25]   THE VEHICLE-ROUTING PROBLEM WITH STOCHASTIC TRAVEL-TIMES [J].
LAPORTE, G ;
LOUVEAUX, F ;
MERCURE, H .
TRANSPORTATION SCIENCE, 1992, 26 (03) :161-170
[26]   Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm [J].
Li, Xiangyong ;
Tian, Peng ;
Leung, Stephen C. H. .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2010, 125 (01) :137-145
[27]   Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements [J].
Liu, Ran ;
Yuan, Biao ;
Jiang, Zhibin .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (02) :558-575
[28]   Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost [J].
Luo, Zhixing ;
Qin, Hu ;
Zhang, Dezhi ;
Lim, Andrew .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 85 :69-89
[29]   The home health care routing and scheduling problem with interdependent services [J].
Mankowska, Dorota Slawa ;
Meisel, Frank ;
Bierwirth, Christian .
HEALTH CARE MANAGEMENT SCIENCE, 2014, 17 (01) :15-30
[30]   A Glowworm Swarm Optimization algorithm for the Vehicle Routing Problem with Stochastic Demands [J].
Marinaki, Magdalene ;
Marinakis, Yannis .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 46 :145-163