摘要

In this paper, we model the public transport network (PTN) to an unweighted network by space L and space P method. The adjacency matrix is used to express this network, in which 1 denotes connection between two vertices and 0 denotes disconnection. According to the complex theory, the statistical characteristics (including average clustering coefficient, average shortest path length, and so on) of the real PTN of Hangzhou are analyzed. By the shortest path algorithm of matrix multiplication, all the least transfer routes between any two bus stations of Hangzhou are gotten. Then the PTN of Hangzhou is modeled toa weighted network using the straight-line distances between the bus stations which are computed by every station';s longitudes and latitudes as the weights. To compare the weights (namely the straight-line distances) of all the least transfer routes, the transfer routes between any two bus stations which not only have the least transfer times but also the shortest straight-line distances are obtained. Finally, by some practical bus stations of Hangzhou, this transfer method is validated.

全文