Evaluating the impact of optimization algorithms for patient transits dispatching using discrete event simulation

N. Furian, M. O'Sullivan, C. Walker, S. Vössner

Research output: Contribution to journalArticleResearchpeer-review

Abstract

The on-time completion of patient transits can be identified as a bottleneck for the efficiency of health care services in major New Zealand hospitals. Delayed transits of patients between wards and treatment or diagnostic facilities lead to increasing waiting times at clinics and inefficient resource utilization (e.g. surgery teams) as appointment times are not met. Patient transits are carried out by orderlies, but in some cases require the assistance of a nurse. Ad-hoc dispatching of staff members, nurses and orderlies, to transits has been identified as one major source for delays currently observed in the system. To address this issue we present automated, optimized dispatching algorithms for staff members performing those transits. To develop these algorithms, a network formulation of the problem is introduced that is strongly related to classical vehicle routing problem with semi-soft time windows. However, the need to synchronize the routes of staff members of different types (nurses and orderlies) adds a whole new layer of complexity to the problem, as routes cannot be assessed independently. We present a set of algorithms with varying complexity, ranging from simple heuristics to the use of critical path methods to combine mixed integer formulations for the separated orderly and nurse problems. To address a transit service's stochasticity, volatility and the resulting need for constant re-optimization, we embed the optimization algorithms in a discrete event simulation to evaluate their performance under realistic circumstances.

LanguageEnglish
Pages134-155
Number of pages22
JournalOperations Research for Health Care
Volume19
DOIs
StatusPublished - 1 Dec 2018

Fingerprint

Nurses
Volatilization
Critical Pathways
New Zealand
Health Services
Appointments and Schedules
Research Design
Delivery of Health Care
Efficiency
Therapeutics

Keywords

  • Column generation
  • Discrete event simulation
  • Limited subsequences
  • Meta-heuristics
  • Patient transit
  • Vehicle routing

ASJC Scopus subject areas

  • Surgery
  • Oral Surgery
  • Otorhinolaryngology

Cite this

Evaluating the impact of optimization algorithms for patient transits dispatching using discrete event simulation. / Furian, N.; O'Sullivan, M.; Walker, C.; Vössner, S.

In: Operations Research for Health Care, Vol. 19, 01.12.2018, p. 134-155.

Research output: Contribution to journalArticleResearchpeer-review

@article{6ad4ff94b3c5452aa01ef1806af19f71,
title = "Evaluating the impact of optimization algorithms for patient transits dispatching using discrete event simulation",
abstract = "The on-time completion of patient transits can be identified as a bottleneck for the efficiency of health care services in major New Zealand hospitals. Delayed transits of patients between wards and treatment or diagnostic facilities lead to increasing waiting times at clinics and inefficient resource utilization (e.g. surgery teams) as appointment times are not met. Patient transits are carried out by orderlies, but in some cases require the assistance of a nurse. Ad-hoc dispatching of staff members, nurses and orderlies, to transits has been identified as one major source for delays currently observed in the system. To address this issue we present automated, optimized dispatching algorithms for staff members performing those transits. To develop these algorithms, a network formulation of the problem is introduced that is strongly related to classical vehicle routing problem with semi-soft time windows. However, the need to synchronize the routes of staff members of different types (nurses and orderlies) adds a whole new layer of complexity to the problem, as routes cannot be assessed independently. We present a set of algorithms with varying complexity, ranging from simple heuristics to the use of critical path methods to combine mixed integer formulations for the separated orderly and nurse problems. To address a transit service's stochasticity, volatility and the resulting need for constant re-optimization, we embed the optimization algorithms in a discrete event simulation to evaluate their performance under realistic circumstances.",
keywords = "Column generation, Discrete event simulation, Limited subsequences, Meta-heuristics, Patient transit, Vehicle routing",
author = "N. Furian and M. O'Sullivan and C. Walker and S. V{\"o}ssner",
year = "2018",
month = "12",
day = "1",
doi = "10.1016/j.orhc.2018.03.008",
language = "English",
volume = "19",
pages = "134--155",
journal = "Operations Research for Health Care",
issn = "2211-6923",
publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Evaluating the impact of optimization algorithms for patient transits dispatching using discrete event simulation

AU - Furian, N.

AU - O'Sullivan, M.

AU - Walker, C.

AU - Vössner, S.

PY - 2018/12/1

Y1 - 2018/12/1

N2 - The on-time completion of patient transits can be identified as a bottleneck for the efficiency of health care services in major New Zealand hospitals. Delayed transits of patients between wards and treatment or diagnostic facilities lead to increasing waiting times at clinics and inefficient resource utilization (e.g. surgery teams) as appointment times are not met. Patient transits are carried out by orderlies, but in some cases require the assistance of a nurse. Ad-hoc dispatching of staff members, nurses and orderlies, to transits has been identified as one major source for delays currently observed in the system. To address this issue we present automated, optimized dispatching algorithms for staff members performing those transits. To develop these algorithms, a network formulation of the problem is introduced that is strongly related to classical vehicle routing problem with semi-soft time windows. However, the need to synchronize the routes of staff members of different types (nurses and orderlies) adds a whole new layer of complexity to the problem, as routes cannot be assessed independently. We present a set of algorithms with varying complexity, ranging from simple heuristics to the use of critical path methods to combine mixed integer formulations for the separated orderly and nurse problems. To address a transit service's stochasticity, volatility and the resulting need for constant re-optimization, we embed the optimization algorithms in a discrete event simulation to evaluate their performance under realistic circumstances.

AB - The on-time completion of patient transits can be identified as a bottleneck for the efficiency of health care services in major New Zealand hospitals. Delayed transits of patients between wards and treatment or diagnostic facilities lead to increasing waiting times at clinics and inefficient resource utilization (e.g. surgery teams) as appointment times are not met. Patient transits are carried out by orderlies, but in some cases require the assistance of a nurse. Ad-hoc dispatching of staff members, nurses and orderlies, to transits has been identified as one major source for delays currently observed in the system. To address this issue we present automated, optimized dispatching algorithms for staff members performing those transits. To develop these algorithms, a network formulation of the problem is introduced that is strongly related to classical vehicle routing problem with semi-soft time windows. However, the need to synchronize the routes of staff members of different types (nurses and orderlies) adds a whole new layer of complexity to the problem, as routes cannot be assessed independently. We present a set of algorithms with varying complexity, ranging from simple heuristics to the use of critical path methods to combine mixed integer formulations for the separated orderly and nurse problems. To address a transit service's stochasticity, volatility and the resulting need for constant re-optimization, we embed the optimization algorithms in a discrete event simulation to evaluate their performance under realistic circumstances.

KW - Column generation

KW - Discrete event simulation

KW - Limited subsequences

KW - Meta-heuristics

KW - Patient transit

KW - Vehicle routing

UR - http://www.scopus.com/inward/record.url?scp=85045565668&partnerID=8YFLogxK

U2 - 10.1016/j.orhc.2018.03.008

DO - 10.1016/j.orhc.2018.03.008

M3 - Article

VL - 19

SP - 134

EP - 155

JO - Operations Research for Health Care

T2 - Operations Research for Health Care

JF - Operations Research for Health Care

SN - 2211-6923

ER -