检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:向婷 李妍峰[1,2] XIANG Ting;LI Yanfeng(School of Economics and Management,Southwest Jiaotong University,Chengdu,Sichuan 610031,China;Service Science and Innovation Key Laboratory of Sichuan Province,Chengdu,Sichuan 610031,China)
机构地区:[1]西南交通大学经济管理学院,四川成都610031 [2]服务科学与创新四川省重点实验室,四川成都610031
出 处:《工业工程与管理》2022年第3期218-226,共9页Industrial Engineering and Management
基 金:国家自然基金面上项目(72071161,71571150);四川省科技厅应用基础研究重大前沿项目(2017JY0225);四川省科技厅应用基础研究项目(2020YJ0220);西南交通大学智慧物流与供应链管理研究生导师团队项目(YJSY-DSTD201918)。
摘 要:以家庭医生签约服务为背景,提出一类同时考虑社区门诊和上门服务的医护人员调度协同优化问题。综合考虑医患匹配、医护人员工作量、上门服务的时间窗以及标本时效性等约束,建立了最小化运营成本和最大化病人偏好的双目标混合整数规划模型,并设计了改进NSGA-Ⅱ算法对问题进行求解。小规模算例的特性分析表明:随着医护人员的最大降级数的增大,运营成本减小,病人满意度增大,高技能级别的医护人员工作量也增加;门诊服务中平均服务率较高的医护人员可以降低门诊等待惩罚。数值实验结果表明,改进NSGA-Ⅱ算法具有较强的搜索能力。Taking the Chinese family contract service as a background,a collaborative routing and scheduling problem combining door-to-door and community outpatient services was proposed.This problem was formulated as a bi-objective mixed-integer model to minimize the total cost and maximize the patient preference satisfaction by considering constraints such as doctor-patient matching,doctors’ working regulation,the hard time window and timeliness of samples in door-to-door services.An improved NSGA-Ⅱ was proposed to solve this problem.The problem properties were analyzed by a small instance.The results demonstrate that with the increase of maximum skill level deviation,the workload of high skill doctors and patient preference satisfaction increase,but the total cost decrease.Meanwhile,arranging doctors with higher service rate to outpatient service can reduce outpatients’ waiting penalties.The numerical studies also show that the improved NSGA-Ⅱ performs well to solve this problem.
关 键 词:家庭医护人员调度问题 M/M/1排队模型 上门服务 门诊服务 NSGA-Ⅱ算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147