Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming

By Verena Schmid. European Journal of Operational Research, 2012

310 citations recorded by the source corpus.

Highlights ► We investigated dispatching and relocation decisions of emergency service providers. ► ADP is powerful in solving the underlying stochastic and dynamic optimization problem. ► Average response time can be improved by using more flexible dispatching rules. ► Relocating ambulances proactively improves service quality. ► Essential to take into account time-dependent information.

Subfields: Industrial and Manufacturing Engineering, Ocean Engineering, Organizational Behavior and Human Resource Management

View Paper: https://www.semanticscholar.org/paper/4e75b8429c6f6997389ac6f35f93ae4f56957a41

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

1. Richard F. Hartl
2. Ulrike Ritzinger
3. Jakob Puchinger

Citations in the corpus

• A survey on dynamic and stochastic vehicle routing problems (2016, background): “Maxwell et al. (2010) and Schmid (2012) demonstrate the successful use of ADP algorithms for the dynamic ambulance relocation and dispatching problem under uncertainty.”