Hybrid Hungarian Algorithm and GVNS metaheuristic for the patient admission scheduling problem
提出一种结合匈牙利算法和通用变邻域搜索的混合方法（HA-GVNS），用于解决患者入院调度问题，在12个基准实例上优于或匹配24种现有最优方法，兼顾解质量与计算效率。
Patient Admission Scheduling involves assigning elective inpatients to hospital beds while considering various constraints such as bed availability, patient medical requirements, departmental and room specifications, patient preferences, and resource utilization. To tackle this complex combinatorial optimization problem, we propose a novel approach combining the Hungarian Algorithm (HA) with the General Variable Neighbourhood Search (GVNS), called HA-GVNS. This method benefits from the strengths of the HA and the iterative improvement capabilities of the GVNS. Extensive experimentation on 12 benchmark instances demonstrates that, in most cases, HA-GVNS outperforms or matches the best solutions of the 24 best state-of-the-art solving techniques. Notably, HA-GVNS effectively balances solution quality with computational efficiency, making it a promising approach for addressing the PAS problem.