基于贪婪双交换启发式算法的护士调度方法  

Nurse scheduling method based on greedy double exchange heuristic algorithm

作　　者：郭晓萍 谷岩梅[2] Guo Xiaoping;Gu Yanmei(980 Hospital of the joint service support force of the people's Liberation Army,Shijiazhuang Hebei 050200,China;Hebei University of Chinese Medicine,Shijiazhuang Hebei 050200,China)

机构地区：[1]中国人民解放军联勤保障部队第980医院,河南石家庄050200 [2]河北中医学院,河北石家庄050200

出　　处：《现代科学仪器》2020年第5期170-175,共6页Modern Scientific Instruments

摘　　要：护士调度问题主要体现在制定时间表受到限制过多,如既有监管要求,又有患者对合适护理专家的需求。护理人员对其工作时间表的偏好也增加了问题的复杂性。为解决上述问题而提出的大多数解决方案都使用软件编程建模,方案通常只考虑硬约束,而护士的心理需求易被忽略,导致护理人员日程表常常在最后一刻发生改变。因此,提出了一种基于贪婪双交换启发式算法的护士偏好优化框架算法模型,该启发式方法在解决实际问题中取得了良好效果,具有推广应用价值。the problem of nurse scheduling is mainly reflected in the fact that there are too many restrictions on the schedule,such as both regulatory requirements and patients'needs for appropriate nursing experts.Therefore,nurses'preference for their work schedule also increases the complexity of the problem.Most of the solutions proposed to solve the above problems use software programming modeling,which usually only considers hard constraints,while the psychological needs of nurses are ignored,resulting in changes in the schedule of nurses at the last minute.Therefore,a framework algorithm model of nurse preference optimization based on greedy double exchange heuristic algorithm is proposed.The heuristic method has achieved good results in solving practical problems,and has the value of popularization and application.

关 键 词：护士调度 偏好 贪婪算法 双交换 

分 类 号：TP393.[自动化与计算机技术—计算机应用技术]