A transfer method of public transport networks by adjacency matrix

  • Authors:
  • Bo Wang;Xu-Hua Yang

  • Affiliations:
  • School of Electro-mechanical and Information Technology, Yiwu Industrial & Commercial College, Yiwu, China;College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, China

  • Venue:
  • ACC'10 Proceedings of the 2010 international conference on Applied computing conference
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, the public transport network (PTN) is modeled to an unweighted network by 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 of the 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 to a weighted network using the straight-line distances between the bus stations which are computed by every station's longitudes and latitudes. To compare the weights (namely the straight-line distance) 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.