The Bus Data Model, the Principle and Algorithm Implementation of Query System

Article Preview

Abstract:

This paper refers to a question about the optimum selection of the city bus routes, according to the different needs of passengers, there are three evaluation criteria: the minimum transfer times, the shortest riding time and the lowest riding expenditure. On the base of the three evaluation criteria we construct three models for the bus system and the bus subway system respectively, using the shortest directed route in the weighted graph, definite database technology; we also adopts the improved Dijkstra algorithm and chromatography to present the resolvent of solving the optimal solution.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1959-1962

Citation:

Online since:

January 2015

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Yang Yahong, Gao Jingchang. Application of Design Patterns for GIS Platform Software[J]. Journal of Jilin University (Information Science Edition), 2003, 21(2): 153155.

Google Scholar

[2] Fu Jianping, Yu Yinhui. Employ and Study of Intelligence Traffic System[J]. Journal of Jilin University (Information Science Edition), 2002, 20(4): 6467.

Google Scholar

[3] Chen Xiaofeng, Cai Xiuyun and Tang Deqiang. Shortest Path Algorithm Analysis and its Application to Bus Route Query [J]. Journal of Engineering Graphics, 2001, (3): 20-24.

Google Scholar

[4] Liang Dai, Fast Shortest Path Algrithm for Road Network and Implementation [A]. (2005).

Google Scholar

[5] Wu Yanpeng, Peng Xiaoqi, Yang Hengfu, Improved Algorith Based on Relational Database Technology for Querying Transit Network [J]. Journal of Central South University. 2009, 40(3).

Google Scholar