具有同时服务需求的家庭护理人员调度研究

Home Health Care Routing Problem with Time Windows and Synchronization

家庭护理服务能有效缓解我国社会老龄化下的养老压力。针对护理人员日常调度问题,考虑服务时间窗、同时服务需求、医护人员等级与客户需求匹配等约束,以总运营成本最小为目标,建立数学模型。设计自适应大规模邻域搜索算法,采用多种移除和插入算法在可行和不可行解空间内进行邻域搜索,利用关系矩阵和时间调整策略加速求解,用模拟退火算法接受邻域解。最后进行数值实验和算法比较,验证算法的有效性。

With the acceleration of aging in China, home health care could ease the burden of support for the elder people. In processing the routine scheduling problem of the medical staffs, time window, capability matching and synchronized services were taken into account. The objective was to minimize the total operating costs. A mixed-integer programming model was proposed. An Adaptive Large Neighborhood Search heuristic was designed to solve the problem. Different removal and insertion algorithms were included and the heuristic was allowed to search in both feasible and infeasible regions. Special matrix and adjustment strategy were created to speed up the solving process. The new solution was accepted by simulated annealing. Numerical experiments and algorithm comparison were carried out to evaluate the performance of the proposed heuristic.