International Journal of Computer Applications
In emergency routing, core problem is how to reach accident area in minimum time. Traditional distance based routing does not always gives optimal path in time in need. This paper presents an enhanced routing method which is based on Dijkstra's algorithm and analytical hierarchical processing. Seven impendence factors which cause delay in emergency situations are found and analytical hierarchical processing is used to compared and analyze these seven factors to give overall weight to each road in network.