多类型家庭护理人员调度问题研究  

Multi-type home care worker scheduling and routing problems

作　　者：袁彪[1] 刘冉[1] 江志斌[1] Yuan Biao Liu Ran Jiang Zhibin(Department of Industrial Engineering ＆ Management, Shanghai Jiao Tong University, Shanghai 200240, Chin)

机构地区：[1]上海交通大学工业工程与管理系,上海200240

出　　处：《系统工程学报》2017年第1期136-144,共9页Journal of Systems Engineering

基　　金：国家自然科学基金资助项目(71302013;61374095;61104173);高等学校博士学科点专项科研基金资助项目(20130073120047);上海市浦江人才计划资助项目(13PJC075);上海市自然科学基金资助项目(13ZR1456400)

摘　　要：以家庭护理企业中人员调度及路线优化问题为研究对象,建立考虑了多类型护理人员约束的数学模型,并将其转化为一个基于集划分的主问题以及若干个基于带资源约束最短路的定价子问题,每一个定价子问题对应于一类护理人员.利用多类型护理人员约束的特点,设计列生成算法和分枝定价算法对问题求解.通过对生成的算例测试,将所提出的算法与Cplex比较,验证其有效性.同时,以一个算例为例,比较采用单一类型和多类型护理人员的运营成本,分析使用多类型护理人员的合理性.In order to tackle the care worker scheduling and routing problem in health care organizations, a mathematical model considering multi-type care workers is constructed. The problem is transformed into a master one based on set partitioning and several sub-problems of pricing based on the resource-constrained elementary shortest path, and each sub-problem corresponds to a type of care workers. Incorporating the features of the constraint, the column generation algorithm and branch and price algorithm are devised to obtain the best solution. The performance of the proposed algorithm is validated and compared with that of the Cplex by solving randomly generated instances. The significance of using multi-type care workers is also analyzed by comparing with using single-type ones.

关 键 词：家庭护理 多类型服务能力 优化调度 分枝定价 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]