检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:向婷 李妍峰[1,2] XIANG Ting;LI Yan-feng(School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China;Service Science and Innovation Key Laboratory of Sichuan Province, Chengdu 610031, China)
机构地区:[1]西南交通大学经济管理学院,四川成都610031 [2]服务科学与创新四川省重点实验室,四川成都610031
出 处:《运筹与管理》2021年第8期233-238,F0003,共7页Operations Research and Management Science
基 金:国家自然基金面上项目(72071161,71571150);四川省科技厅应用基础研究重大前沿项目(2017JY0225);西南交通大学智慧物流与供应链管理研究生导师团队项目(YJSY-DSTD201918);四川省科技厅应用基础研究项目(2020YJ0220)。
摘 要:人口老龄化程度的持续加重使得家庭医疗护理服务逐渐发展。本文针对家庭护理人员调度优化问题,考虑医患的技能匹配、加班费用、加班时长和工作量分配的均衡性等因素,设定最大技能偏差和工作时长,建立了最小化运营成本和最小化最大加班时长的双目标混合整数规划模型。设计了改进的NSGA-II和SPEA-II算法对问题进行求解,数值实验表明:最大加班时长越长,运营成本越小;最大技能偏差和医护人员早到惩罚对目标的影响明显;小规模算例中两算法均表现良好,大中型规模算例中改进SPEA-II的效率更高。Home health care industry gradually develops with the continuously aging population.In this paper,the home health care scheduling problem is formulated as a bi-objective mixed-integer programming problem which aims at minimizing the total costs and the maximum overtime.The maximum skill deviation and maximum working time are considered,as well as the nurse-patient skill matching,the overtime cost,the overtime duration and the workload balance.To solve the proposed problem,an improved NSGA-II and an improved SPEA-II are developed.The computational results show that the costs decrease as the maximum overtime increase.The maximum skill deviation and unit waiting penalty can affect the objectives obviously.Both algorithms perform well in small instances,while the efficiency of improved SPEA-II is better than the improved NSGA-II in the middle and large instances.
关 键 词:家庭护理 技能匹配 加班时长 带时间窗车辆路径问题
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49