摘要
随着中国人口老龄化程度加深和医疗资源短缺,社会对家庭医疗护理的需求大大增加。针对家庭医疗护理人力资源分配问题,提出将计算复杂且不能应用于大规模算例的带时间窗多期多车辆路径规划问题分解为资源分配、护理计划和路径规划问题。在资源分配阶段,建立了一个层次优化模型以优先平衡服务人员的利用率并避免客户访问冲突,应用一个概率模型使在没有求解路径规划问题的情况下考虑时间窗约束。设计了一个遗传算法来求解大规模资源分配问题。研究的原创性是在资源分配阶段考虑时间窗约束和所提出的层次优化算法。实验结果验证了模型的有效性。
An ever increasing aging population and medical resource shortage problems in China increase the demand for home health care services. For the human resource assignment problem in home health care, the multi-period multi-Vehicle Routing Problem with time windows, which is computationally difficult and not viable for large-sized problems, was proposed to address the assignment of patients to care providers (assignment), the care plan (scheduling) and the sequence of visits for each provider (routing). In the assignment stage, a lexicographical rnodel was proposed to preferentially balance the utilization among operators and then avoid overlapping of visits at home. Time windows were considered at the assignment level using a probabilistic model without the need of solving the routing problem. A genetic algorithm was proposed to solve the large-sized assignment problem. The consideration of time windows at assignment level represents the main original contribution of this work, together with the formulation of the lexicographic approach. Numerical experiments were executed to validate the performance of the proposed models.
出处
《工业工程与管理》
CSSCI
北大核心
2017年第3期83-92,共10页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(61473188)
关键词
家庭医疗护理
时间窗
车辆路径规划
数学规划
最优化
home health care
time window
vehicle routing problem
mathematical programming
optimization