Title: A New Updated Shortest Path Algorithm for Urban Public Bus Network
Abstract: There are many researches and applications about the shortest path searching in GIS field, but mainly focusing on the algorithmic efficiency analysis and modeling. When those algorithm models are applied in the specific fields, they will face many difficulties for themselves to solve the details in cases. The typical sample is found in the shortest path searching for urban public bus network by using a shortest path searching algorithm based on the neighborhood node network, causing some problems in its applications, such as the lack of topo-logical network information, the difficulty to handle the complicated attribute data, etc. In this paper, the authors propose a new updated shortest path algortithem for urban public bus network through two aspects for optimization of algorithm and data storage configuration. The first one proposes the solution for constructing the topology of public bus network by automatic matching the bus stop and bus line data using the algortithm (before the shortest path calculation), and the second solution improves data storage efficiency by using the database to store the complicated transport attribute data and the newly produced transport network data in the processing, rather than through RAM. The scheme was applied in Beijing public bus network testing system, and has got satisfied effects in usability of data and saving ram storage.
Publication Year: 2005
Publication Date: 2005-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot