Abstract
In this paper we present two iterative methods for solving a model to evaluate busy probabilities for Emergency Medical Service (EMS) vehicles. The model considers location dependent service times and is an alternative to the mean service calibration method; a procedure, used with the Hypercube Model, to accommodate travel times and location-dependent service times. We use monotonicity arguments to prove that one iterative method always converges to a solution. A large computational experiment suggests that both methods work satisfactorily in EMS systems with low ambulance busy probabilities and the method that always converges to a solution performs significantly better in EMS systems with high busy probabilities.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 903-916 |
| Number of pages | 14 |
| Journal | Operations Research |
| Volume | 39 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1991 |
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research