Breadth-first search based bus transport transfer algorithm

Authors:
Zhang-Wei Li;Mei Zhu
Affiliations:
College of Information Engineering, Zhejiang University of Technology, Hangzhou, Zhejiang, China;College of Information Engineering, Zhejiang University of Technology, Hangzhou, Zhejiang, China
Venue:
ACACOS'10 Proceedings of the 9th WSEAS international conference on Applied computer and applied computational science
Year:
2010

Citing 1
Cited 1

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Waiting/cruising location recommendation based on mining on occupied taxi data

MACMESE'10 Proceedings of the 12th WSEAS international conference on Mathematical and computational methods in science and engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper uses the method of space P to model the bus transport network (BTN), by which an unweighted complex network model is obtained. The statistical characteristics of BTN are analyzed simply. Then by using the breadth-first search algorithm, we get all the least transfer routes between two inquired stations. Third we introduce the vertex weight, namely every station's longitudes and latitudes. The edge weight --total straight-line distance between every two stations--will be got by computing the vertex weight. Further we model the BTN to a weighted complex network. A final transfer route which has the shortest total straight-line distance on the basis of the least transfer is obtained by this weighted complex network model and all the least transfer routes are got in prior. The practical data of Hangzhou City is used to testify the new algorithm's efficiency.