SearcharxivSearch

arXiv subjects

Tabea Brandt

Publications and source records attributed to Tabea Brandt.

4 recordsLinked to original sources

Instance Generation for Patient-to-room Assignment and Admission Scheduling Based on Real Hospital Data

Developing algorithms for real-life problems that perform well in practice depends on the availability of realistic data for testing. Obtaining real-life data for optimization problems in health care, however, is often difficult, and such data typically cannot be published, which limits reproducibility by other researchers. This is especially true for patient-related problems because of data privacy policies such as the patient-to-room assignment problem. Therefore, artificially generated instances are commonly used. To improve the generation of realistic instances, we develop a configurable instance generator for the patient-to-room assignment problem and other patient-related problems, featuring an easy-to-use graphical user interface. The design of the generator is based on an extensive empirical analysis of real hospital data, which identifies relevant ward-specific patterns such as patients' age and length-of-stay distributions. Moreover, as randomly generated instances are often infeasible, we address this issue in two ways. We implement a dynamic programming approach in the generator to optionally enforce feasibility and extend existing results from the literature to derive new combinatorial insights into patient-to-room feasibility.

math.OC

Combinatorial and Computational Insights about Patient-to-room Assignment under Consideration of Roommate Compatibility

During a hospital stay, a roommate can significantly influence a patient's overall experience both positivly and negatively. Therefore, hospital staff tries to assign patients together to a room that are likely to be compatible. However, there are more conditions and objectives to be respected by the patient-to-room assignment (PRA), e.g., ensuring gender separated rooms and avoiding transfers. In this paper, we review the literature for reasons why roommate compatibility is important as well as for criteria that can help to increase the probability that two patients are suitable roommates. We further present combinatorial insights about computing patient-to-room assignments with optimal overall roommate compatibility. We then compare different IP-formulations for PRA as well as the influence of different scoring functions for patient compatibility on the runtime of PRA integer programming (IP) optimisation. Using these results and real-world data, we conclude this paper by developing and evaluating a fast IP-based solution approach for the dynamic PRA.

math.OC

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements

Patient-to-room assignment (PRA) is a scheduling problem in decision support for hospitals. It consists of assigning patients to rooms according to certain objectives, e.g., avoiding transfers and respecting single-room requests. This work presents combinatorial insights about the feasibility of PRA and about the assignment of patients to single rooms. We further compare different IP-formulations for PRA as well as the influence of different objectivs on the runtime. Based on these results, we develop a fast IP-based solution approach which obtains high quality solution. The applicability is verified through a computational study with instances derived from real-world data. Results indicate that large, real world instances can be solved to a high degree of optimality within (fractions of) seconds.

math.OC

Integrated patient-to-room and nurse-to-patient assignment in hospital wards

Assigning patients to rooms and nurses to patients are critical tasks within hospitals that directly affect patient and staff satisfaction, quality of care, and hospital efficiency. Both patient-to-room assignments and nurse-to-patient assignments are typically agreed upon at the ward level, and they interact in several ways such as jointly determining the walking distances nurses must cover between different patient rooms. This motivates to consider both problems jointly in an integrated fashion. This paper presents the first optimization models and algorithms for the integrated patient-to-room and nurse-to-patient assignment problem. We provide a mixed integer programming formulation of the integrated problem that considers the typical objectives from the single problems as well as additional objectives that can only be properly evaluated when integrating both problems. Moreover, motivated by the inherent complexity that results from integrating these two NP-hard and already computationally challenging problems, we devise an efficient heuristic for the integrated patient-to-room and nurse-to-patient assignment problem. To evaluate the running time and quality of the solution obtained with the heuristic, we conduct extensive computational experiments on both artificial and real-world instances. The artificial instances are generated by a parameterized instance generator for the integrated problem that is made freely available.

math.OC