求解护士分配问题的矩阵编码进化算法

发布时间：2018-03-19 06:34

本文选题：组合优化　切入点：护士分配问题　出处：《计算机工程与应用》2015年04期 　论文类型：期刊论文

【摘要】：护士分配问题是护理人力资源配置中的一个优化问题,也是计算机科学中的很有挑战性的NP难问题。根据中国实际医院需求日益增加的情况,研究改良了随机规划(SPA)模型,建立了优化的多场景护士分配模型。基于护士与病人的对应关系,设计了0/1矩阵作为算法编码;采用矩阵编码进化算法(EAs with Matrix Coding)框架对矩阵编码进行迭代。基于求同存异的思想,运用随机编码部分介入技术实现了矩阵型染色体的变异算子。实验结果表明,与目前的随机贪心算法、基于Bender's分解的启发式算法和随机扰动遗传算法相比,提出的矩阵编码进化算法在求解护士分配问题时能得到更高质量、更稳定的解;在多场景和多约束前提下,其平均性能优势更加明显。
[Abstract]:The allocation of nurses is an optimization problem in the allocation of nursing human resources, and it is also a challenging NP-hard problem in computer science. According to the increasing demand of hospitals in China, the improved stochastic programming (spa) model is studied. Based on the corresponding relationship between nurses and patients, the 0/1 matrix is designed as the algorithm coding. The matrix coding with Matrix coding framework is used to iterate the matrix coding. Based on the idea of seeking common ground while reserving differences, the mutation operator of matrix chromosome is realized by using the partial intervention technique of random coding. The experimental results show that, Compared with the current stochastic greedy algorithm, the heuristic algorithm based on Bender's decomposition and the stochastic perturbation genetic algorithm, the proposed matrix coding evolutionary algorithm can obtain higher quality and more stable solution in solving the nurse assignment problem. On the premise of multi-scenario and multi-constraint, the average performance advantage is more obvious.
【作者单位】：清远职业技术学院信息科技系;华南理工大学软件学院;
【基金】：国家自然科学基金(No.61370102) 广东省自然基金课题(No.S2012010010613)
【分类号】：TP301.6

【相似文献】