基于拉格朗日松弛的手术中心调度算法

• 作 者: 周炳海 殷萌 钟臻怡
• 机 构: 同济大学机械与能源工程学院,
• 出 处: 系统工程理论与实践
• 发表日期: 2016年01期
• 关键词: 拉格朗日松弛 手术 调度算法 手术中心调度 多目标优化 问题规模 子问题 分枝定界 算法 对偶间隙

为了有效提高手术中心的利用率,降低医院的成本,提高病人满意度,本文提出了基于拉格朗日松弛的手术中心调度算法.首先对问题域进行了描述,以最小化手术中心相关成本和最大化病人满意度为目标,建立数学规划模型.在此基础上,建立可行调度解策略,结合手术中心特有的约束条件,提出基于拉格朗日松弛的手术中心调度方法,并用分枝定界求解子问题.最后,设计不同问题规模的实验,对算法性能进行了评价和对比分析,实验表明,该算法能在可接受的计算时间内得到较好的近优解.

In order to effectively improve the utilization rate of operation center, reduce hospital costs and improve patient satisfaction, this paper presents a surgical center scheduling algorithm based on Lagrangian relaxation.First, the problem domain is described to minimize the costs associated with the operation center and This paper establishes a feasible scheduling solution strategy, combined with the unique constraints of the operation center, proposes a surgical center scheduling method based on Lagrangian relaxation, and uses the branch and bound Solve the subproblems.Finally, experiments on different scale problems are designed to evaluate and contrast the performance of the algorithm. Experiments show that the algorithm can get better near optimal solutions within acceptable computing time.