The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Approximate Dynamic Programming for Ambulance Redeployment
Abstract
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should redeploy idle ambulances so as to maximize the number of calls reached within a delay threshold. We begin by formulating this problem as a dynamic program. To deal with the high-dimensional and uncountable state space in the dynamic program, we construct approximations to the value function that are parameterized by a small number of parameters. We tune the parameters using simulated cost trajectories of the system. Computational experiments demonstrate the performance of the approach on emergency medical service systems in two metropolitan areas. We report practically significant improvements in performance relative to benchmark static policies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Hoffman, K. A. (1961) · Cited by 2,706
Approximate Dynamic Programming: Solving the Curses of Dimensionality
Powell, W. B. (2011) · Wiley Series in Probability and Statistics · doi:10.1002/9781118029176 · Cited by 2,297
Advances in Neural Information Processing Systems 18
Murray, I., Mackay, D., Zoubin Ghahramani, A., & Skilling, J. (2006) · Cited by 1,927
Stochastic optimal control : the discrete time case
Bertsekas, D. P., & Shreve, S. E. (2007) · Cited by 1,654
Approximate Dynamic Programming: Solving the Curses of Dimensionality
Powell, W. B. (2007) · Wiley Series in Probability and Statistics · doi:10.1002/9780470182963 · Cited by 1,566
An analysis of temporal-difference learning with function approximation
Tsitsiklis, J. N., & Van Roy, B. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.580874 · Cited by 1,194
(2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_588 · Cited by 950
Handbook of Learning and Approximate Dynamic Programming
Si, J., Barto, A. G., Powell, W. B., & Wunsch, D. (2004) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470544785 · Cited by 856
Ambulance location and relocation models
Brotcorne, L., Gilbert Laporte, A., & Semet, F. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00364-8 · Cited by 813
The Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2003) · Operations Research · doi:10.1287/opre.51.6.850.24925 · Cited by 687
Regression methods for pricing complex American-style options
Tsitsiklis, J. N., & Van Roy, B. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.935083 · Cited by 612
Improving Elevator Performance Using Reinforcement Learning
Crites, R. H., & Barto, A. G. (1995) · Cited by 499
Powell, W. B. (2007) · Cited by 471
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
Gendreau, M., Laporte, G., & Semet, F. (2001) · Parallel Computing · doi:10.1016/s0167-8191(01)00103-x · Cited by 455
Asynchronous stochastic approximation and Q-learning
Tsitsiklis, J. N. (1994) · Machine Learning · doi:10.1007/bf00993306 · Cited by 453
Generalized polynomial approximations in Markovian decision processes
Schweitzer, P. J., & Seidmann, A. (1985) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(85)90317-8 · Cited by 330
Operations Research and Health Care: A Handbook of Methods and Applications
(2004) · International Series in Operations Research & Management Science · doi:10.1007/b106574 · Cited by 329
Dynamic Bid Prices in Revenue Management
Adelman, D. (2007) · Operations Research · doi:10.1287/opre.1060.0368 · Cited by 250
Decision support tools for ambulance dispatch and relocation
Andersson, T., & Värbrand, P. (2006) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602174 · Cited by 243
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
Singh, S. P., & Bertsekas, D. P. (1996) · Cited by 214
Probabilistic and Randomized Methods for Design under Uncertainty
(2006) · Springer eBooks · doi:10.1007/b138725 · Cited by 212
A Price-Directed Approach to Stochastic Inventory/Routing
Adelman, D. (2004) · Operations Research · doi:10.1287/opre.1040.0114 · Cited by 204
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
Topaloğlu, H., & Powell, W. B. (2006) · INFORMS journal on computing · doi:10.1287/ijoc.1040.0079 · Cited by 195
An Algorithm for the Dynamic Relocation of Fire Companies
Kolesar, P., & Walker, W. E. (1974) · Operations Research · doi:10.1287/opre.22.2.249 · Cited by 186
A neuro-dynamic programming approach to retailer inventory management
Roy, B. V., Bertsekas, D. P., Lee, Y., & Tsitsiklis, J. N. (2002) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1997.652501 · Cited by 153
Erlang loss models for the static deployment of ambulances
Restrepo, M., Henderson, S. G., & Topaloğlu, H. (2008) · Health Care Management Science · doi:10.1007/s10729-008-9077-4 · Cited by 64
Self-citation
Cited by
A survey on dynamic and stochastic vehicle routing problems
Ritzinger, U., Puchinger, J., & Hartl, R. F. (2016) · International Journal of Production Research · doi:10.1080/00207543.2015.1043403 · Cited by 443
Hulshof, P. J. H., Kortbeek, N., Boucherie, R. J., Hans, E. W., & Bakker, P. J. M. (2012) · Health Systems · doi:10.1057/hs.2012.18 · Cited by 429
Emergency medical services and beyond: Addressing new challenges through a wide literature review
Aringhieri, R., Bruni, M. E., Khodaparasti, S., & van Essen, J. T. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2016.09.016 · Cited by 339
Online routing and battery reservations for electric vehicles with swappable batteries
Adler, J. D., & Mirchandani, P. B. (2014) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2014.09.005 · Cited by 103
Metadata
- Authors
- Maxwell, M. S., Restrepo, M., Henderson, S. G., & Topaloglu, H.
- Venue
- INFORMS Journal on Computing
- Published
- 2010-05
- Volume
- 22
- Issue
- 2
- Pages
- 266-281
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2088363515
- Cited by
- 283
- References
- 31
- FWCI
- 17.09
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.