The Minimum Expected Penalty Relocation Problem for the Computation of Compliance Tables for Ambulance Vehicles
From MaRDI portal
Publication:3186666
DOI10.1287/ijoc.2015.0687zbMath1343.90052OpenAlexW2341478942MaRDI QIDQ3186666
Publication date: 12 August 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/24609
Related Items (5)
Compliance tables for an EMS system with two types of medical response units ⋮ Spatiotemporal Data Set for Out-of-Hospital Cardiac Arrests ⋮ Multi-period stochastic programming models for two-tiered emergency medical service system ⋮ Ambulance Emergency Response Optimization in Developing Countries ⋮ Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles
Cites Work
- Unnamed Item
- Ambulance location and relocation problems with time-dependent travel times
- Ambulance location and relocation models.
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- Covering models and optimization techniques for emergency response facility location and planning: a review
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Time-dependent MEXCLP with start-up and relocation cost
- Approximate Dynamic Programming for Ambulance Redeployment
- The Maximal Expected Covering Location Problem: Revisited
- The maximal expected coverage relocation problem for emergency vehicles
- Ambulance location for maximum survival
- Decision support tools for ambulance dispatch and relocation
- Approximating the Performance of Urban Emergency Service Systems
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
This page was built for publication: The Minimum Expected Penalty Relocation Problem for the Computation of Compliance Tables for Ambulance Vehicles
