Benchmarking online dispatch algorithms for emergency medical services
From MaRDI portal
Publication:1751696
DOI10.1016/j.ejor.2016.08.061zbMath1394.90405OpenAlexW2513588355MaRDI QIDQ1751696
Pieter L. van den Berg, Robert D. van der Mei, Caroline Jagtenberg
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/25101
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Stochastic scheduling theory in operations research (90B36) Case-oriented studies in operations research (90B90)
Related Items (3)
A recursive simulation-optimization framework for the ambulance location and dispatching problem ⋮ Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles ⋮ Integrating the ambulance dispatching and relocation problems to maximize system's preparedness
Cites Work
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- A dial-a-ride problem for client transportation in a health-care organization
- The dial-a-ride problem: Models and algorithms
- Approximate Dynamic Programming for Ambulance Redeployment
- A Bound on the Performance of an Optimal Ambulance Redeployment Policy
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Competitive algorithms for server problems
- Response Areas for Two Emergency Units
- Dynamic programming based metaheuristics for the dial-a-ride problem
This page was built for publication: Benchmarking online dispatch algorithms for emergency medical services
