REVIEW ON SHORTEST ROUTE PROBLEM IN URBAN NETWORK SYSTEM

The shortest path problem has been studied for over 40 years in diverse fields and transportation. It is one of the fundamental rules that is being used to find a minimum distance to reach the destination, with minimum time consumption in a cost effective manner. In the modern world, it is very useful in planning the efficient shortest routes that is essential for transportation, telephone network, electricity power supply network, gas pipeline network, water supply, drainage network system etc. The complexity of network, cost and time required for networking is increasing in different kinds of network systems and identification of shortest paths plays pivotal role. In graph theory, the number of algorithms can be applied for finding shortest paths in a graph based network system. It reduces complexity of network routes, cost and time to build and maintain network based systems. In this review of literature, some of the gateways in finding out the shortest path that have been developed in the past in different networks are highlighted. The goal of this study is to select a cross-section of approaches in identifying the shortest path in different fields of research usingGeographical Information System (GIS) and (Global Positioning Systems) GPS. Keywords—Shortest path, Algorithms, GIS