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

DOI10.1016/j.ejor.2011.10.043zbMath1253.90155OpenAlexW1988963644WikidataQ41650045 ScholiaQ41650045MaRDI QIDQ1926680

Verena Schmid

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.043

zbMATH Keywords

stochastic optimizationapproximate dynamic programmingOR in health servicesemergency vehiclesambulance location

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36) Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Related Items (38)

Balancing efficiency and equity in location-allocation models with an application to strategic EMS design ⋮ A simulation model to enable the optimization of ambulance fleet allocation and base station location for increased patient survival ⋮ Effective truckload dispatch decision methods with incomplete advance load information ⋮ Large-network travel time distribution estimation for ambulances ⋮ Approximate dynamic programming for the dispatch of military medical evacuation assets ⋮ The Minimum Expected Penalty Relocation Problem for the Computation of Compliance Tables for Ambulance Vehicles ⋮ Ambulance routing for disaster response with patient groups ⋮ Least squares approximate policy iteration for learning bid prices in choice-based revenue management ⋮ Emergency medical services and beyond: addressing new challenges through a wide literature review ⋮ A survey of healthcare facility location ⋮ ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH ⋮ Ambulance dispatching during a pandemic: Tradeoffs of categorizing patients and allocating ambulances ⋮ Multi-period stochastic programming models for two-tiered emergency medical service system ⋮ Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization ⋮ Meso-parametric value function approximation for dynamic customer acceptances in delivery routing ⋮ Dynamic dispatching and repositioning policies for fast-response service networks ⋮ A recursive simulation-optimization framework for the ambulance location and dispatching problem ⋮ Optimization of the ambulance fleet location and relocation ⋮ Sliding-mode surface-based adaptive actor-critic optimal control for switched nonlinear systems with average dwell time ⋮ Equilibrium-based workload balancing for robust emergency response operation ⋮ The incremental cooperative design of preventive healthcare networks ⋮ Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles ⋮ Benchmarking online dispatch algorithms for emergency medical services ⋮ Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem ⋮ Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels ⋮ An efficient distributed optimization and coordination protocol: application to the emergency vehicle management ⋮ Integrating the ambulance dispatching and relocation problems to maximize system's preparedness ⋮ Ambulance routing in disaster response considering variable patient condition: NSGA-II and MOPSO algorithms ⋮ Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review ⋮ Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies ⋮ Improving fairness in ambulance planning by time sharing ⋮ An extremal problem with applications to renewable energy production ⋮ Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics ⋮ Dispatching fire trucks under stochastic driving times ⋮ Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming ⋮ Scenario-based, closed-loop model predictive control with application to emergency vehicle scheduling ⋮ Unnamed Item ⋮ Opportunities for reinforcement learning in stochastic dynamic vehicle routing

Uses Software

• Commentary

Cites Work

• Unnamed Item
• Unnamed Item
• Ambulance location and relocation problems with time-dependent travel times
• Heuristic solution of an extended double-coverage ambulance location problem for Austria
• Ambulance location and relocation models.
• A multiperiod set covering location model for dynamic redeployment of ambulances
• Feature Article—Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming
• Commentary—Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming
• Approximate Dynamic Programming for Ambulance Redeployment
• The maximal expected coverage relocation problem for emergency vehicles
• Solving an ambulance location model by tabu search
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• Approximate Dynamic Programming
• The Location of Emergency Service Facilities
• Application of the Double Standard Model for Ambulance Location
• A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
• A representational paradigm for dynamic resource transformation problems

This page was built for publication: Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming