A dynamic station-line centrality for identifying critical stations in bus-metro networks

IF 5.6 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Chaos Solitons & Fractals Pub Date : 2025-05-01 Epub Date: 2025-02-26 DOI:10.1016/j.chaos.2025.116102
Xianghua Li , Min Teng , Shihong Jiang , Zhen Han , Chao Gao , Vladimir Nekorkin , Petia Radeva
{"title":"A dynamic station-line centrality for identifying critical stations in bus-metro networks","authors":"Xianghua Li ,&nbsp;Min Teng ,&nbsp;Shihong Jiang ,&nbsp;Zhen Han ,&nbsp;Chao Gao ,&nbsp;Vladimir Nekorkin ,&nbsp;Petia Radeva","doi":"10.1016/j.chaos.2025.116102","DOIUrl":null,"url":null,"abstract":"<div><div>Accurate identification of critical stations is essential for urban public transport networks (UPTNs). However, existing methods mainly focus on the static network structure and single transport systems, limiting their capacity to accurately capture the time-varying importance of stations. To address the limitation, this paper proposes a new method named dynamic station-line centrality (DSLC) to accurately identify the critical stations within bus-metro networks. Initially, this paper constructs a bus-metro load network (BMN) model to address the interaction between bus and metro systems. BMN can effectively reveal the connection tightness between stations, track transfers between different systems, and monitor dynamic passenger flows. Subsequently, we propose DSLC to accurately assess and quantify the time-varying importance of stations. Specifically, a topology enhancement strategy leveraging dynamic passenger flows and community structures is proposed to enhance the topology characteristics of nodes with great passenger flow significance, while overcoming the reliance on time-consuming shortest path algorithms. Additionally, DSLC addresses the identification of time-varying node importance by integrating the reinforcing relationship between stations and server lines. Extensive experiments on a public dataset of Shanghai BMN and comparison to the state-of-the-art methods validate the effectiveness of DSLC in enhancing the robustness and mitigating the propagation of cascading failures. Moreover, DSLC achieves an average improvement of 25.54% in passenger flow loss compared to the suboptimal algorithms, providing valuable insights for traffic managers.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"194 ","pages":"Article 116102"},"PeriodicalIF":5.6000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos Solitons & Fractals","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0960077925001158","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/26 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Accurate identification of critical stations is essential for urban public transport networks (UPTNs). However, existing methods mainly focus on the static network structure and single transport systems, limiting their capacity to accurately capture the time-varying importance of stations. To address the limitation, this paper proposes a new method named dynamic station-line centrality (DSLC) to accurately identify the critical stations within bus-metro networks. Initially, this paper constructs a bus-metro load network (BMN) model to address the interaction between bus and metro systems. BMN can effectively reveal the connection tightness between stations, track transfers between different systems, and monitor dynamic passenger flows. Subsequently, we propose DSLC to accurately assess and quantify the time-varying importance of stations. Specifically, a topology enhancement strategy leveraging dynamic passenger flows and community structures is proposed to enhance the topology characteristics of nodes with great passenger flow significance, while overcoming the reliance on time-consuming shortest path algorithms. Additionally, DSLC addresses the identification of time-varying node importance by integrating the reinforcing relationship between stations and server lines. Extensive experiments on a public dataset of Shanghai BMN and comparison to the state-of-the-art methods validate the effectiveness of DSLC in enhancing the robustness and mitigating the propagation of cascading failures. Moreover, DSLC achieves an average improvement of 25.54% in passenger flow loss compared to the suboptimal algorithms, providing valuable insights for traffic managers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于识别公交-地铁网络中关键站点的动态站线中心性
关键站点的准确识别对城市公共交通网络(uptn)至关重要。然而,现有的方法主要集中在静态网络结构和单一运输系统上,限制了它们准确捕捉车站时变重要性的能力。为了解决这一问题,本文提出了一种新的动态站线中心性(DSLC)方法来准确识别公交-地铁网络中的关键站点。本文首先建立了公交-地铁负荷网络模型,以解决公交系统与地铁系统之间的相互作用。BMN可以有效地揭示车站之间的连接紧密程度,跟踪不同系统之间的换乘,监测动态客流。随后,我们提出了DSLC来准确地评估和量化台站的时变重要性。具体而言,提出了一种利用动态客流和社区结构的拓扑增强策略,以增强具有重要客流意义的节点的拓扑特征,同时克服了对耗时最短路径算法的依赖。此外,DSLC通过整合站点和服务器线路之间的强化关系来解决时变节点重要性的识别问题。在上海BMN公共数据集上进行了大量实验,并与最先进的方法进行了比较,验证了DSLC在增强鲁棒性和减轻级联故障传播方面的有效性。此外,与次优算法相比,DSLC在客流损失方面平均改善了25.54%,为交通管理人员提供了有价值的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Chaos Solitons & Fractals
Chaos Solitons & Fractals 物理-数学跨学科应用
CiteScore
13.20
自引率
10.30%
发文量
1087
审稿时长
9 months
期刊介绍: Chaos, Solitons & Fractals strives to establish itself as a premier journal in the interdisciplinary realm of Nonlinear Science, Non-equilibrium, and Complex Phenomena. It welcomes submissions covering a broad spectrum of topics within this field, including dynamics, non-equilibrium processes in physics, chemistry, and geophysics, complex matter and networks, mathematical models, computational biology, applications to quantum and mesoscopic phenomena, fluctuations and random processes, self-organization, and social phenomena.
期刊最新文献
Stability and averaging principle for fractional jump–diffusion systems of order 1<ρ<2 Frequency-aware gradient modulated boosted trees for interpretable financial distress prediction PT-symmetric ring-like superposed KM solitons in 2D PT coupled waveguide A new model for the analysis of low-thrust trajectory design in the Earth–Moon system A fast algorithm for estimating the maximum k-core number in random graphs with given expected degree sequences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1