混合优化方法解决医疗排班难题，获2024年竞赛第三名。
A hybrid solution approach for the Integrated Healthcare Timetabling Competition 2024
- 分三阶段分解问题，融合整数规划、约束规划与模拟退火。
- 首次给出基准实例的下界，验证解的质量与改进空间。
- 适合研究医疗调度、混合优化算法的学者与工程师。
本文介绍代尔夫特理工大学团队在2024年整合医疗排班竞赛中提交的解决方案，该方案最终位列决赛前三。我们的方法采用三阶段分解策略，结合混合整数规划、约束编程与模拟退火。除了阐述方法设计与决策过程，我们首次提供了基准实例的最优解下界。通过分析竞赛解质量及扩展运行时间下的表现，深入研究了各类软约束及算法关键模块。最后，指出了尚未解决的问题与未来研究方向。
原文摘要 · Abstract (English)
In this work, we present the solution approach for the Integrated Healthcare Timetabling Competition 2024 submitted by Team Twente, which ultimately ranked third among the finalists. Our approach combines mixed-integer programming, constraint programming, and simulated annealing in a 3-phase solution approach based on decomposition into subproblems. In addition to describing our approach and design decisions, we share our insights and, for the first time, lower bounds on the optimal solution values for the benchmark instances. We analyze the results based on solution quality for the competition and an extended runtime Additionally, we investigate the different soft constraints and specific parts of the algorithm. Finally, we highlight open problems and future research directions for further improving the approach.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。