Abstract—Network analysis in geospatial information system (GIS) provides strong decision support for users in searching optimal route, finding the nearest facility and determining the service area. Searching optimal path is an important advanced analysis function in GIS. In present GIS route finding modules, heuristic algorithms have been used to carry out its search strategy. Due to the lack of global sampling in the feasible solution space, these algorithms have considerable possibility of being trapped into local optima. This paper addresses the problem of selecting route to a given destination on an actual map under a static environment. The proposed solution uses a genetic algorithm (GA). A customized method based on a genetic algorithm has been proposed in this paper. In single pair path algorithms we have tested for Iterative algorithm, Dijkstra algorithm, Best First A* Algorithms and the results were shown.

Index Terms—GIS, SDSS, Genetic Algorithm, Route Finding, Vehicle Routing Problem

Avash Raichaudhuri has done his bachelor of engineering in Biomedical Engineering from S.A.T.I Vidisha, M.P. India. He then did his post graduation in retail management from Birla Institute of Management Technology, Gr.Noida, India. He is currently working with Hariyali Kisaan Bazaar (A division of DCM Sriram Consolidated Ltd) as Logistics Executive.
Email :- avashr@yahoo.com, avashr@gmail.com
phone: +91-9990239402, +91-120-3968-571
Ashi Jain has done her bachelor of engineering in Biomedical Engineering from S.A.T.I Vidisha, M.P. India. She is currently pursuing her post graduation in banking and finance from Narsee Monjee Institute of Management Studies, Mumbai India. She is working as a Software Engineer with Tata Consultancy Services, Gurgaon.
Email:- ashi.jain@tcs.com , ashijain85@yahoo.com