An Adaptive Large Neighbourhood Search Procedure Applied to the Dynamic Patient Admission Scheduling Problem

Richard Martin Lusby, Martin Schwierz, Troels Martin Range () and Jesper Larsen
Additional contact information
Richard Martin Lusby: Department of Engineering Management, Postal: Technical University of Denmark, Kgs. Lyngby, Denmark
Martin Schwierz: AMCS, Postal: Copenhagen, Denmark
Troels Martin Range: Department of Business and Economics, Postal: University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark
Jesper Larsen: Department of Engineering Management, Postal: Technical University of Denmark, Kgs. Lyngby, Denmark

No 1/2016, Discussion Papers on Economics from University of Southern Denmark, Department of Economics

Abstract: The Patient Admission Scheduling problem 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, treatment efficiency, and hospital utilization are maximized. Usually it is assumed that all information regarding each patient is known in advance, making it possible to solve a static, offline planning problem. Such an approach, however, often has shortcomings in practice given the dynamic setting in which hospitals operate. An extension of this problem, known as the Dynamic patient Admission Scheduling problem, better reflects reality by attempting to capture, among other things, uncertainty in the length of patient stays as well as the ability to consider emergency patients. In this paper we devise an Adaptive Large Neighbourhood Search procedure, utilizing a Simulated Annealing framework, for this new variant of the problem and test its performance on a set of 450 publicly available problem instances of different size. 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, but in a much shorter time frame. For larger instances the improvement in solution quality is dramatic, approximately 3-14% on average. In such cases, it does, however, take slightly longer.

Keywords: Metaheuristic; ALNS; OR in health services; Scheduling (search for similar items in EconPapers)
JEL-codes: C61 (search for similar items in EconPapers)
Pages: 19 pages
Date: 2016-03-18
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sdu.dk/-/media/files/om_sdu/institutter ... dpbe1_2016.pdf?la=da (application/pdf)
Our link check indicates that this URL is bad, the error code is: 500 Can't connect to www.sdu.dk:80 (A connection attempt failed because the connected party did not properly respond after a period of time, or established connection failed because connected host has failed to respond.)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hhs:sdueko:2016_001

Access Statistics for this paper

More papers in Discussion Papers on Economics from University of Southern Denmark, Department of Economics Department of Economics, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark. Contact information at EDIRC.
Bibliographic data for series maintained by Astrid Holm Nielsen ().