A Travel Route Query Model And Implementation Based On Strategy Of Assigning Weights For Public Transport

Now, with the increases of the urban population size and amount, the status of urbanpublic transport appears to become more and more important. There are very importanttheoretical significance and practical significance about how to provide the accurate and fasttravel information to travelers and to serve the people’s diverse needs.The researchers at home and abroad have carried out a large number of studies for thepublic transport network, and they have established various models for the theoreticalarguments and practical use. For example: express public transport network with two re-mapto solve a variety of transfer issues; establish public transportation model with Dijkstraalgorithm to solve the issue of the shortest trip distance; solve the stand-off frequency of theleast problems with the breadth-first search algorithm and so on.At present all kinds of models and search algorithms are designed to solve a certainproblem or a certain demand, but with the growing diversity and individuation of people’stravel needs, a single model and query processing algorithm can not meet people’s needsclearly. This paper presents a common public transport query model which has universal andflexible features. You can set different WPights to meet people’s different needs. The textmeet five different strategies of the travel requirements through different set of WPights: thetime-shortest value setting strategy, the distance-shortest value setting shortest, theleast-passing stations setting strategy, the shortest-walking setting strategy, and the track-firstsetting strategy. After experimental verification, the model this paper presented have a gooduniversal, it can achieve the purpose that people travel for different needs just with thechanging of the right and different strategies. Of course, there are some problems about theveracity of the real-time data acquisition and the consummate of the system functions in thispaper, they would be further discussed and improved in the future.