الفهرس | Only 14 pages are availabe for public view |
Abstract Rapid emergency response to the scene of a traffic accident and transportation of the injured to a medical facility is critical for saving lives. Traffic congestion is a major problem in urban areas, especially in an overcrowded city like the Great Cairo (GC). Traffic congestion can disrupt emergency response, but dynamic network routing can offer solutions. Geographic Information system (GIS) can be a useful tool for determining emergency vehicle response routing, and the application of dynamic variables like historical traffic data can help emergency response vehicles avoid traffic congestion and improve response times. This study proposes a methodology where route solvers based on Dijkstra{u2019}s shortest path algorithm in ArcGIS Network Analyst were utilized to identify the closest ground emergency response unit (e.g., healthcare services providers) to each incident and then solving the shortest path problem centered around emergency response routing scenarios. Cost attributes or impedances, namely distance and Time-Varying Travel Time (TVTT) originating from historical traffic data, were applied to each routing scenario to determine the shortest and the best (optimal) routes from an origin to a destination. It also proposes an enhanced routing technique based on Dijkstra{u2019}s algorithm and the Analytic Hierarchy Process (AHP) to be used in emergency cases |