Design And Implementation Of Bus Travel Service Based On NewMap Server

With the development of the digital city, many cities start to construct geographic information public service platform. Bus travel as one of the essential functions in platform, is still developed independently by the platform, which not only need to invest a lot of manpower and financial resources, but also need software and hardware equipment and personnel quality that are very demanding. Moreover, bus travel’s repetitive construction on platforms also resulted in a waste of resources. If the bus travel function provided in the form of service, then each platform only needs to invoke the service. Like Baidu, Google and Amap, all of them can provide bus travel service interface, but if you call their service, can only use their data that updates slowly and misses part of small and medium-sized cities’ data, which undoubtedly brings users bad experiences. In addition to that, their services not only limit the visits per day, but charge exorbitant fees for extra visits too.NewMap Server is one of the mainstream GIS software to develop geographic information public service platform. This paper tries to study how to provide bus travel service based on NewMap Server, the data needed to publish service can be provided and updated by the user. The main research results of this paper include the following four aspects:First, in the research of data model, try to design simple data model that represented by GIS vector data structure, including bus stop model, bus road model, subway exit model, network node model and network road model. Furthermore, try to develop a preprocessing tool replacing people to establish topological relationships between the data.Second, in the research of bus transfer algorithm, the algorithm using the least transfer algorithm which meets people travel psychology. This paper puts forward a method to ensure the best origin and destination stop. Aiming at the efficiency problem after introducing the walk, some methods are proposed, including origin and destination stop pairing, one to N search model, joining two thresholds to control the search process. At last, using experiment to verify the feasibility and effectiveness of the improved algorithm.Third, using the improved A* algorithm to calculate the shortest walk path in bus travel routes. Finding out the node whose f value is the minimum in open table is the most time consuming. In order to improve the search speed, the open table is made with vector and map container, and using binary heap to maintain the open table always orderly. For the sake of making the idea of A* algorithm is suitable for the calculation of walking path in the bus travel routes, the A* algorithm do the adjustment in the input conditions, the end conditions, backtracking search path and so.Fourth, according to people’s actual needs of bus travel routes and bus information, this paper designs 11 service interfaces, uses c++ in visual studio 2010 environment to implement them, uses the improved algorithms including the least transfer algorithm and A* algorithm to calculate bus travel route, and shows the application of the bus travel service.