Research And Implementation Of Web Service Based Routing

With the development of Internet and the pervasive spread of computer hardware and software, GIS has stepped into the era of Web, from the consolidated single machine mode or integrated system. Web GIS makes the cross-platform interaction possible with the B/S architecture.This paper starts with the framework designing of the system. Based on the system requirements, this article designs the overall framework, working DB, service middleware and mobile software packaging. The architecture is hierarchical, using B/S technology, it emphasizes on Web Service concept, implementing the communication of software and platform as well as the mobile app packaging with Phone Gap, which makes a fast generation of mobile cross-platform mobile app. This architecture realize the cutting-edge advantages of quick, open and extensible.Traffic flow and route planning are the important research goals of this paper. Although there are many research methods in routing, seldom will they take the traffic flow into account. Some routing suggestion are based on the simulated flow data rather than making the real time traffic as the precondition of the travel. In fact, it is not difficult to explain this phenomenon. There are not so many methods to derive the real time traffic flow condition. The data is mainly controlled by the traffic departments or data collection companies. It will be expensive to buy this data and there is no other choice.Therefore, this paper has proposed a scheme. Based on crawling the traffic tile data provided be web service provider, I try to match them with the current vertex data. This algorithm determines the traffic congestion information from the RGB value of the raster image and assign the attributes to the corresponding linear segments to digitalize to traffic status of this road segments. From doing this, it generates the traffic information for research while minimizing the cost to the most.Real time traffic lays a good foundation for the route planning. The traffic field of segment data attributes refreshes to reflect the current status of the congestion. After generating the shortest route between two points with the algorithm of Dijkstra, it takes the congestion status as the cost value attribute to reroute and finally gets the optimized route than the shortest. Comparing the shortest route and traffic optimized route, it is obvious that the latter one successfully avoids the congestion road. In the end, it provides the convenience and saves time for the people.