A Study on Shortest Route Planning in Road Transportation Networks Using Remote Sensing Technology

Abstract

     In the present scenario, information technology plays a major role in the world economics. If we get the timely information about the resources of the city then we could plan and manage its resources in a better way, for the economically and environmentally sustainable urban development. Land cover and the human or natural alteration of land cover play a major role in global scale patterns of climate. Rapid urbanization and urban sprawl have significant impact on conditions of urban ecosystems. Changes in land use and land cover are directly linked to many facets of human health and welfare, including biodiversity, food production, and the origin and spread of disease. One of the major problems that are coming now days in the cities is the unauthorized developments of the colonies, which creates a lot of problems. Therefore accurate and updated information on the status and trends of urban resources is needed to develop strategies, and efficient planning and management of the resources of the city for sustainable development and to improve the livelihood of cities. Study area that we have chosen is the Meerut city. Now, our study of shortest route planning in road networks is a distinctive computing optimal route in any road networks that can be come across in world applications of algorithms. As we have studied that the use of Dijkstra and Warshal’s algorithms is a classical solution of graph theory. A large and massive road network would fail or become too slow, because of heavy rush of load traffic. Therefore we have to adopt some speedup techniques, which classically invest some time into preprocessing step in organizing to generate auxiliary data that can be used to pick up the pace in all consequent route planning queries. Below the paradigm of algorithm engineering, i.e. design, put into operation and appraises three highly-efficient and demonstrable perfect point to point route planning algorithms. All these algorithms have different benefits-and one common many-to-many approach, which computers for given node sets, source (s) and terminal (t), will show the optimal distance between all nodes pairs (s, t), (s, t)∈S×T in a well organized way. The evaluation is done in a far-reaching practical study using outsized real world in a road networks with approximately 3.5 crore junctions. Freeway hierarchies develop the intrinsic hierarchical configuration of road networks and classify road networks and roads by significance. A point to point doubt is then performed in a bidirectional manner such as forward and backward. Forward will count from source and backward from the target. Highway node routing is associated in both the directions with hierarchical approach. This technique is conceptually effortless and quick processing, which allows the implementation of update routines that are able to react in fast processing manner like traffic jams. Transit node routing (TNR) is a fast and exact distance oracle for road networks. Our standard many-to-many algorithms; can be instigated based on certain bidirectional route planning techniques, e.g. highway hierarchies or highway-node routing. It computes an entire |S|×|T| distance table, basically performing only |S| forward plus |T| backward queries instead of |S| times |T| bidirectional queries. Among all route preparation methods that achieve considerable speedups, it has one of the fastest query times and requires small amount memory necessities.

Cite this Article

Ritu Singh, Yogesh Awasthi, Praveen Kumar. A Study on Shortest Route Planning in Road Transportation Networks Using Remote Sensing Technology. Journal of Computer Technology & Applications. 2017; 8(1): 23–28p.