南昌市公交网络的复杂性研究(英文)

Research on complexity of public transport network in Nanchang City

从复杂网络的角度,研究了南昌市公交线路、公交站点和公交换乘3种不同网络的拓扑结构特性,计算了各网络的特征路径长度、聚类系数、度、邻近度和介数等.研究表明:南昌市公交线路和公交换乘网络属于小世界网络,但公交线路网络并不具有明显的指数性或幂律性,公交换乘网络具有指数分布特征;公交站点网络度分布服从幂律分布,但不具有小世界性质.与其他城市公交网络进行比较,针对南昌市公交站点网络存在网络直径和特征路径长度较大的特点,提出了南昌市公交网络优化的具体建议.

The complex network theory is applied to researching the topologic properties of Nanchang public transportation network（PTN）.The network is defined in three different ways：C-space,L-space and P-space.We calculated the topological parameters such as characteristic path length,clustering coefficient,degree,closeness and betweenness.The results show that the C-space and P-space networks in Nanchang City are kind of the small-world networks,the former having no apparent exponential or power law distribution,the latter having apparent exponential distribution.While L-space network keeps to the power-law distribution,it has no small-world property.In comparison with other urban PTNs,we find the L-space network in Nanchang City has the shortcomings of greater diameter and characteristic path length.Finally,some constructive suggestions are put forward for optimizing the urban PTN in Nanchang City.