Abstract
We propose a multi-neighborhood local search procedure to solve a healthcare problem, known as the Patient Admission problem. We design and experiment 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 some lower bounds on benchmark instances based on the relaxation of some constraints and the solution of a minimum-cost maximum-cardinality matching problem on a bipartite graph. The outcome is that our results compare favorably with the previous work on the problem, improving on all the available instances, and are also quite close to the computed lower bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burke, E.K., Causmaeker, P.D., Berghe, G.V., Landeghem, H.V.: The state of the art of nurse rostering. Journal of Scheduling 7, 441–499 (2004)
Cipriano, R., Di Gaspero, L., Dovier, A.: Hybrid approaches for rostering: A case study in the integration of constraint programming and local search. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., Pérez Pérez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol. 4030, pp. 110–123. Springer, Heidelberg (2006)
Gemmel, P., Van Dierdonck, R.: Admission scheduling in acute care hospitals: does the practice fit with the theory? International Journal of Operations & Production Management 19(9), 863–878 (1999)
Demeester, P., De Causmaecker, P., Vanden Berghe, G.: Automatically assigning patients to beds resulting in improved hospital performance. Technical report, KaHo Sint-Lieven, Gent 06/2008 (2008)
Bilgin, B., Demeester, P., Vanden Berghe, G.: A hyperheuristic approach to the patient admission scheduling problem. Technical report, KaHo Sint-Lieven, Gent (2008)
Demeester, P.: Patient admission scheduling web site (2009), http://allserv.kahosl.be/~peter/pas/index.html (Viewed: June 1, 2009)
Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms 5(1), 65–89 (2006)
Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester (1997)
Hoos, H.H., Stützle, T.: Stochastic Local Search – Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)
Di Gaspero, L., Schaerf, A.: EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software—Practice and Experience 33(8), 733–765 (2003)
West, D.B.: Introduction to graph theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)
GLPK: GNU Linear Programming Kit, reference manual, Version 4.38 (May 2009)
Box, G.E.P., Hunter, J.S., Hunter, W.G.: Statistics for Experimenters: Design, Innovation, and Discovery, 2nd edn. Wiley Interscience, Hoboken (2005)
Venables, W.N., Ripley, B.D.: Modern applied statistics with S, 4th edn. Statistics and Computing. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ceschia, S., Schaerf, A. (2009). Multi-neighborhood Local Search for the Patient Admission Problem. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds) Hybrid Metaheuristics. HM 2009. Lecture Notes in Computer Science, vol 5818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04918-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-04918-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04917-0
Online ISBN: 978-3-642-04918-7
eBook Packages: Computer ScienceComputer Science (R0)