基于单亲遗传禁忌搜索算法的手术排程问题研究  

Research on operating room scheduling problem based on partheno-genetic tabu search algorithm

作　　者：李惠[1,2] 蒋大奎[1] 

机构地区：[1]天津大学管理与经济学部,天津300072 [2]天津中医药大学人文管理学院,天津300193

出　　处：《计算机应用研究》2013年第3期699-702,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(70871086)

摘　　要：针对规模较大的手术排程问题,分别以所有病人完成手术过程的最长时间和平均时间最小化为目标,构建了手术排程问题的数学模型。在分析解的最优化条件基础上,设计了一种将单亲遗传算法与禁忌搜索算法相结合的混合优化算法。按照个体的优劣及算法迭代情况设计了一种自适应选择机制,使个体自适应地选择执行变异操作或禁忌搜索算法。最后,仿真实验结果表明了所提算法的有效性和自适应选择机制的可行性。This paper studied a large-scale operation room scheduling problem to minimize the longest operation time and the average operation time for operating on all patients respectively, and built the mathematical model. Based on optimal condition analysis, it designed an integrated heuristic algorithm, which combined partheno-genetie algorithm and tabu search algorithm. Furthermore, it also proposed an adaptive selection mechanism and selected individuals by which to perform mutation operation or tabu search algorithm according to the value of individual fitness and iteration of algorithm. Finally, simulation results demonstrate the efficiency of the designed algorithm and the feasibility of the adaptive selection mechanism.

关 键 词：手术排程 单亲遗传算法 禁忌搜索 自适应选择 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] F224.3[自动化与计算机技术—控制科学与工程]