.png){kind=icon}
返回
Solving the patient admission scheduling problem using constraint aggregation
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2024.02.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Patient admission scheduling (PAS) consists of assigning patients to beds over a planning horizon to maximize treatment efficiency, patient satisfaction, and hospital utilization while meeting all necessary medical constraints and considering patient preferences as much as possible. There are several different variants of the PAS problem in the literature, which differ mainly in the constraints that must be satisfied (hard) or can be violated (soft). Due to the intrinsic difficulty of the PAS problem, solving large integer programming (IP) models to optimality is challenging. In this paper, we consider the widely studied variant of the PAS problem that has the maximum number of soft constraints, and focus on how to reduce the size of IP formulations of the PAS problem to improve the solving efficiency. We employ a two -stage optimization method where the first stage builds reduced models by constraint aggregation to improve the typical formulation of the PAS problem. Experimental results on the 13 benchmark instances in the literature indicate that our method can obtain new improved solutions (new upper bounds) for 6 instances, including one proven optimal solution. For the 5 other instances whose optimal solutions are known, our approach can reach these known optimal solutions in a shorter computation time compared to the existing methods. In addition, we apply our method to the original PAS problem, which has the maximum number of hard constraints, and perform computational experiments on the same 13 benchmark instances. Our method yields 5 new best solutions and proves optimality for 6 instances.
Keyword:
OR in healthcare
Patient admission scheduling
Constraint aggregation
Integer programming
Healthcare management
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics动态空间分配问题: 应用混合抓取和禁忌搜索元启发式OAAI
OAAI分享收藏分享收藏Integrated airline crew scheduling: A hi-dynamic constraint aggregation method using neighborhoods集成的航空公司机组调度: 使用邻域的高动态约束聚合方法
PREAI
分享收藏分享收藏
查看更多内容