Cargando…
Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
Emergency service providers are supposed to locate ambulances such that in case of emergency patients can be reached in a time-efficient manner. Two fundamental decisions and choices need to be made real-time. First of all immediately after a request emerges an appropriate vehicle needs to be dispat...
Autor principal: | Schmid, Verena |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
North-Holland Pub. Co
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4268654/ https://www.ncbi.nlm.nih.gov/pubmed/25540476 http://dx.doi.org/10.1016/j.ejor.2011.10.043 |
Ejemplares similares
-
Ambulance location and relocation problems with time-dependent travel
times
por: Schmid, Verena, et al.
Publicado: (2010) -
A decomposition-based multiobjective evolutionary algorithm using Simulated Annealing for the ambulance dispatching and relocation problem during COVID-19
por: Hemici, Meriem, et al.
Publicado: (2023) -
Approximate Dynamic Programming: Solving the Curses of Dimensionality
por: Powell, Warren B
Publicado: (2011) -
Ambulance Problems Solved and Unsolved
Publicado: (1914) -
Approximate dynamic programming : solving the curses of dimensionality
por: Powell, Warren B., 1955-
Publicado: (2011)