Scheduling and routing ambulances that provide inter-facility patient transfers

@inproceedings{Ardekani2014SchedulingAR,
  title={Scheduling and routing ambulances that provide inter-facility patient transfers},
  author={Laleh Haerian Ardekani and Dan Haight and Armann Ingolfsson and M. M. A. Salama and Matt Stanton},
  year={2014}
}
In Edmonton and Calgary, Canada, a specialized ambulance fleet transfers patients between hospitals. We use a vehicle routing heuristic to schedule transfers that are known a day in advance, and a similar heuristic to accommodate emergent transfers in real time. We use simulation experiments to compare the performance of this approach to historical schedules and find that improvements appear to be possible on all performance metrics that we investigated, ranging from 60% for dead-heading to 3… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A unified tabu search heuristic for vehicle routing problems with time windows

  • J-F Cordeau, G Laporte, A Mercier
  • The Journal of the Operational Research Society,
  • 2001
Highly Influential
6 Excerpts

Local search heuristics for the probabilistic dial-a-ride problem

  • S Ho, D Haugland
  • OR Spectrum,
  • 2011
1 Excerpt

Similar Papers

Loading similar papers…