The Weighted Shortest Path Search in Mobile GIS Services

Min Peng, Naixue Xiong, Gang Xie, Laurence Tianruo Yang

Abstract: Traditional GIS buffer inquiries focus on the length of the road path on map only. In this paper, an expanded method is proposed to support the distribution of mobile GIS services. According to the user’s requirement and known buffer area radius on map, we defined the factors to calculate the optimal path from one node to the target node in a map, which considers not only the length of the road, but also traffic flow, road cost and other factors. We use the integrated cost to re-define the road path weights, and then select the optimal path among the road based on the minimum weight. The actual experimental results shown that based on the quantified traffic flow and road condition, from node to other target nodes, we can get an optimal path on map, which satisfies the condition mostly. The results can greatly assist the inquiry of the optimal path in GIS services.