This paper clips a reduced graph from a graph, and redefined it into levels. Then find the set of shorter paths from Source to Destination. Source node as root in the first level and destination node as leafs in different levels of the graph. This paper formulates an algorithm which provides other shorter paths from source to destination. The graph may represent network lines for transferring packets, pipeline for transfering liquid and transportation links. The proposed algorithm finds the shortest path and discovers other shorter paths from source to destination with lesser traffic. The selection of node is done using GIS because it is capable enough to express the connectivity of node with one another. The proposed algorithm is compared with Dijksra's Algorithm and the results are satisfactory. Simulated results are formulated using Matlab. The result assures the potential of the Algorithm.

1. International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:10 No:02 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali
2. Evolutionary Algorithms for the Multiobjective Shortest Path Problem José Maria A. Pangilinan and Gerrit K. Janssens
3. Generalized Shortest Path Problem in Uncertain Environment Based on PSO Hayder A. Mukhef, Ekhlas M. Farhan and Mohammed R. Jassim. Cultural Electronic Services Centre, University of Technology, Baghdad, Iraq Department of Electrical and Electronics, University of Technology, Baghdad, Iraq Center of Training and Work Shops, University of Technology, Baghdad, Iraq
4. Three Fastest Shortest Path Algorithms on Real Road Network: Data Structures and Procedures; F. Benjamin Zhan; Department of Geography and planning, Southwest Texas State University, San Marcos. TX78666, USA.
5. Naghibi F. 2002, application GIS in petroleum Industry, M. sc, Research Seminar, Dept. of Surveying and Geomatic Eng. Faculty, University of Tehran.
6. Integrating geo-spatial information technologies and participatory methods in agricultural development. M. Narayana Reddy and N. H. Rao.
7. Bilal Gonen, "Genetic Algorithm Finding the Shortest Path in Networks", University of Nevada, Reno.
8. Tarak Nath Paul and Dr. Abhoy Chand Mondal, "Constitute A Sub-Graph With n-levels To Search A Set Of Shorter Paths Using Genetic Algorithm", IEEE Internaitonal Conference on Intelligent Computing and Intelligent System, 3-0096-10943, Volume 3, 452-456, November 2011.
9. Tarak Nath Paul and Dr. Abhoy Chand Mondal, "Faster Genetic Algorithm For Traverse Large Distance", National Conference on Computing and System, 56-59, January 2010.
10. Tarak Nath Paul and Dr. Abhoy Chand Mondal, "Intelligent Traversing Method Using Genetic Algorithm For Long Distance", International Conference on Computing and System, 69-74, November 2010

Geospatial Information System Shortest Path Algorithm Routing Graph.