An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem

OBJECTIVE The aim of this paper is to provide an improved method for solving the so-called dynamic patient admission scheduling (DPAS) problem. This is a complex scheduling problem that involves assigning a set of patients to hospital beds over a given time horizon in such a way that several quality measures reflecting patient comfort and treatment efficiency are maximized. Consideration must be given to uncertainty in the length of stays of patients as well as the possibility of emergency patients. METHOD We develop an adaptive large neighborhood search (ALNS) procedure to solve the problem. This procedure utilizes a Simulated Annealing framework. RESULTS We thoroughly test the performance of the proposed ALNS approach on a set of 450 publicly available problem instances. A comparison with the current state-of-the-art indicates that the proposed methodology provides solutions that are of comparable quality for small and medium sized instances (up to 1000 patients); the two approaches provide solutions that differ in quality by approximately 1% on average. The ALNS procedure does, however, provide solutions in a much shorter time frame. On larger instances (between 1000-4000 patients) the improvement in solution quality by the ALNS procedure is substantial, approximately 3-14% on average, and as much as 22% on a single instance. The time taken to find such results is, however, in the worst case, a factor 12 longer on average than the time limit which is granted to the current state-of-the-art. CONCLUSION The proposed ALNS procedure is an efficient and flexible method for solving the DPAS problem.

[1]  Sara Ceschia,et al.  Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays , 2014, J. Sched..

[2]  Rj Rob Kusters,et al.  Modelling resource availability in general hospitals Design and implementation of a decision support model , 1996 .

[3]  Richard S. Sutton,et al.  Introduction to Reinforcement Learning , 1998 .

[4]  P. Harper.  A Framework for Operational Modelling of Hospital Resources , 2002, Health care management science.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Peter Demeester,et al.  One hyper-heuristic approach to two timetabling problems in health care , 2012, J. Heuristics.

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  Jesper Larsen,et al.  A column generation approach for solving the patient admission scheduling problem , 2014, Eur. J. Oper. Res..

[11]  Phongchai Jittamai,et al.  A hospital admission planning model for emergency and elective patients under stochastic resource requirements and no-shows , 2011, 2011 IEEE International Conference on Industrial Engineering and Engineering Management.

[12]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[13]  Sara Ceschia,et al.  Modeling and solving the dynamic patient admission scheduling problem under uncertainty , 2012, Artif. Intell. Medicine.

[14]  Sara Ceschia,et al.  Local search and lower bounds for the patient admission scheduling problem , 2011, Comput. Oper. Res..

[15]  Zhi-hui Zhan,et al.  A genetic algorithm for the optimization of admission scheduling strategy in hospitals , 2010, IEEE Congress on Evolutionary Computation.

[16]  Peter A. N. Bosman,et al.  Agent-based patient admission scheduling in hospitals , 2008, AAMAS.

[17]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[18]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 2005, IEEE Transactions on Neural Networks.

[19]  Frits C. R. Spieksma,et al.  Patient-to-room assignment planning in a dynamic context , 2012 .

[20]  David Meignan,et al.  Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism , 2010, J. Heuristics.

[21]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[22]  Patrick De Causmaecker,et al.  A hybrid tabu search algorithm for automatically assigning patients to beds , 2010, Artif. Intell. Medicine.