基于蚁群算法的护理实习排班多约束问题研究

Multi-constrained problem of nursing interns scheduling based on ant colony algorithm

护理实习排班是医院提高护理教学质量、优化护理实习工作的重要保障。护理排班问题是一个多约束条件下的组合优化问题,针对其排班约束条件多、排班问题随实习人员科室的增多而复杂等特点,提出了以相对约束作为性能指标、具有通用性的多约束护理实习排班数学模型,该模型可以满足国内大多数医院护理实习排班需要。利用蚁群算法解决多约束最优问题的优势,提出基于蚁群算法的最优护理实习排班方案,通过对我院护理实习生进行排班,排班实验结果满足各约束要求。该算法能有效应用于护理排班最优排班方案。

Nursing interns is an important guarantee for hospital to improve the quality of nursing teaching and to optimize nursing practice. Nursing interns scheduling problem is an optimization problemwith multiple constraints. For the problem,the scheduling constraints are manyand scheduling problems are more complex with the increase in departments,a scheduling mathematical model of multi-constrained nursing interns with relative constraints as a performance index was proposed. The model can meet the needs of most domestic hospital nursing interns scheduling. The ant colony algorithm is used to solve the optimal nursing interns scheduling which satisfies the multi-constraints,and the nursing interns are arranged in our hospital,the scheduling results meet the requirements. The algorithm can be applied to the optimal scheduling of nursing interns.