Home health care routing and scheduling problem with the consideration of outpatient services
Home health care routing and scheduling problem with the consideration of outpatient services
复制标题
考虑门诊服务的家庭医疗保健路线和调度问题
DOI：
10.1016/j.tre.2021.102420
复制
发表时间：
2021-07-25
影响因子：
10.6
通讯作者：
Szeto, Wai Yuen
中科院分区：
文献类型：
--
作者：
Li, Yanfeng;Xiang, Ting;Szeto, Wai Yuen
在中国，家庭医生合同服务既可以在家中为老年人或行动困难患者提供居家保健服务，也可以在社区护理中心为普通患者提供门诊服务。本文提出了一个考虑门诊服务的家庭保健路线和调度问题。考虑时间窗、技能要求和工作规则约束，将问题构建为一个混合整数非线性凸规划模型，以最小化上门服务的总出行成本和门诊患者的总等待惩罚，最大化患者偏好满意度的总收益。对于小尺度问题，采用外逼近法求其全局e-最优解，对于大尺度问题，采用混合遗传算法求解。通过一个小实例分析了问题的性质和外逼近方法的性能。大规模算例的结果表明，所提出的混合遗传算法能够以较短的计算时间提供高质量的解。
In China, family doctor contract service can provide not only the home health care service for the elderly or patients with mobility difficulties at their homes but also the outpatient service mainly for ordinary patients in the community care center. This paper presents a home health care routing and scheduling problem with the consideration of outpatient services. By considering the constraints about time windows, skill requirements, and working regulations, the problem is formulated as a mixed-integer nonlinear and convex programming model to minimize the total travel costs of the door-to-door service and the total waiting penalties of out-patients, and maximize the total benefit of patients' preference satisfaction. We adopt an outer-approximation method to obtain its global e-optimal solutions for the small scale problem and develop a hybrid genetic algorithm to solve the large problem. A small instance is set up to analyze the problem properties and the performance of the outer-approximation method. The results of large scale examples show that the proposed hybrid genetic algorithm can provide high-quality solutions with short computing times.