当前位置: X-MOL 学术Physica A › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Topological properties of bus transit networks considering demand and service utilization weight measures
Physica A: Statistical Mechanics and its Applications ( IF 2.8 ) Pub Date : 2020-05-11 , DOI: 10.1016/j.physa.2020.124683
Manju Manohar Manjalavil , Gitakrishnan Ramadurai

We present a complex weighted network analysis of a bus transport network. We model the network as graphs in L-space and P-space and evaluate the statistical properties in unweighted and weighted cases. The weights considered include number of overlapping routes and passenger demand between two bus stops. We also introduce a new supply-based edge weight called Service Utilization Factor (SUF) and define it as the passenger demand per service between two stops. We extract the origin and destination of the passenger trips from bus ticket information. In the bus system under study, the tickets are issued between ’stages’ instead of between bus stops. We propose a points of interest based procedure to map the passenger demand between stages to between bus stops. The network has scale-free behaviour with preferential attachment of nodes and is similar to small-world networks. It is well-connected with an average of 1.4 transfers required to travel between any two points in the network. We identify redundant routes in the network from strength values in the SUF weighted networks. Disassortativity in the demand weighted network indicated that bus stops with higher attractiveness are not necessarily situated contiguously along a route. The SUF weighted network is assortative indicating presence of well-serviced stops along the same the route. We identified the stops with higher betweenness centrality, that can be ideal candidates for being developed as hubs. Our conclusions exemplify the importance of considering route overlaps, passenger demand and service utilization in bus network analysis and for building an efficient bus network.



中文翻译:

考虑需求和服务利用权重度量的公交网络拓扑特性

我们介绍了公交运输网络的复杂加权网络分析。我们将网络建模为L空间和P空间中的图形,并评估未加权和加权情况下的统计属性。考虑的权重包括两条公交车站之间的重叠路线数量和乘客需求。我们还引入了一种新的基于供应的边缘权重,称为服务利用率(小号üF),并将其定义为两个站点之间每项服务的乘客需求。我们从公交车票信息中提取旅客的出发地和目的地。在所研究的公交系统中,门票是在“阶段”之间而不是在公交车站之间发行的。我们提出了一个基于兴趣点的程序,以绘制阶段之间到公交车站之间的乘客需求。该网络具有优先连接节点的无标度行为,类似于小型网络。它连接良好,平均需要1.4次传输才能在网络中的任意两个点之间传输。我们从SUF加权网络的强度值中识别网络中的冗余路由。需求加权网络的分散性表明,具有较高吸引力的公交车站不一定沿路线连续放置。SUF加权网络是分类的,指示沿同一路线存在服务良好的站点。我们确定了具有较高中间性的中止站,可以成为发展为枢纽的理想选择。我们的结论充分说明了在公交网络分析中考虑路线重叠,乘客需求和服务利用的重要性,以及构建高效公交网络的重要性。

更新日期:2020-05-11
down
wechat
bug