摘要
针对大规模手术排程问题,科室不能1天内完成所有手术时,在考虑相关医疗资源约束条件下,以提高术间利用率与当日手术数量为优化目标,建立求解多目标手术排程问题的优化模型;基于改进的非支配排序算子和拥挤距离算子、自适应交叉变异机制、锦标赛选择机制和精英策略设计改进的非支配排序遗传算法(improved non-dominated sorting genetic algorithm Ⅱ,INSGA-Ⅱ)求解问题,并提出种群染色体唯一策略等以进一步提升算法的搜索性能;并通过对某三甲医院的日手术排程过程进行仿真实验,验证了所提出的手术排程方法的可行性和有效性。
In view of big scale of patient surgical scheduling problem, when all operations can not be completed in one day, taking the related resource constraints into account, a mathematical model of solving surgical scheduling problem is proposed. It aims to improve the operating room utilization rate and the number of surgery for the day. According to the characteristics of the problem an improved non - dominated sorting genetic algorithm II is proposed based on improved crowding distance calculating operator, adaptive crossover, mutation mechanism, tournament se- lection mechanism and elitist strategy in the selection operator. The algorithm also proposed population chromosome unique policy to improve the diversity of the population and algorithm' s searching performance. Finally, simulation result based on a third class hospital shows the effectiveness and feasibility of the proposed model.
出处
《科技与管理》
2017年第3期53-61,共9页
Science-Technology and Management
基金
国家自然科学基金项目(71533001)
中央高校基本科研业务费专项资金资助项目(DUT15QY32)
关键词
手术排程
术间利用率
手术进度
多目标优化
改进的NSGA—Ⅱ
surgical scheduling
utilization rate of OR
surgical process
multi - objective optimization
improved NSGA - Ⅱ