Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XL-8, 1105-1114, 2014
https://doi.org/10.5194/isprsarchives-XL-8-1105-2014
© Author(s) 2014. This work is distributed under
the Creative Commons Attribution 3.0 License.
 
28 Nov 2014
Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm
S. Dutta1, D. Patra1, H. Shankar2, and P. Alok Verma2 1MCA, Narula Institute of Technology, Kolkata, West Bengal, 700109, India
2Geoinformatics Department, Indian Institute of Remote Sensing, Dehradun, 248001, India
Keywords: Transportation Network, GIS Tool, Minimum Spanning Tree (MST), Prim’s Algorithm, Network Analysis Abstract. minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim’s algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it’s minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several cities optimally or connecting all cities with minimum total road length.
Conference paper (PDF, 1337 KB)


Citation: Dutta, S., Patra, D., Shankar, H., and Alok Verma, P.: Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm, Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XL-8, 1105-1114, https://doi.org/10.5194/isprsarchives-XL-8-1105-2014, 2014.

BibTeX EndNote Reference Manager XML