Local search and lower bounds for the patient admission scheduling problem

Authors:
Sara Ceschia;Andrea Schaerf
Affiliations:
DIEGM, University of Udine, via delle Scienze 208, I-33100 Udine, Italy;DIEGM, University of Udine, via delle Scienze 208, I-33100 Udine, Italy
Venue:
Computers and Operations Research
Year:
2011

Citing 11
Cited 2

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
General Cooling Schedules for a Simulated Annealing Based Timetabling System

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms

Software—Practice & Experience
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
The State of the Art of Nurse Rostering

Journal of Scheduling
A hybrid tabu search algorithm for automatically assigning patients to beds

Artificial Intelligence in Medicine
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition

INFORMS Journal on Computing
Modern Applied Statistics with S

Modern Applied Statistics with S

Modeling and solving the dynamic patient admission scheduling problem under uncertainty

Artificial Intelligence in Medicine
An investigation on the generality level of selection hyper-heuristics under different empirical conditions

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a multi-neighborhood local search procedure to solve a healthcare problem, known as the Patient Admission Scheduling problem. We design and experiment with different combinations of neighborhoods, showing that they have diverse effectiveness for different sets of weights of the cost components that constitute the objective function. We also compute many lower bounds based on the relaxation of some constraints. The outcome is that our results compare favorably with the previous work on the problem, improving all available instances, and in some cases are also quite close to the lower bounds. Finally, we propose the application of the technique to the dynamic case, in which admission and discharge dates are not predictable in advance.