.png){kind=icon}
.png){kind=icon}
Return
A novel distributed parallel simulation method with dynamic partitioning using KLeiden-based community detection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.tre.2025.104625.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Formulate a partition optimization model to minimize the total simulation time. • Propose a KLeiden-based community detection solver for network partitioning with a formal optimality proof. • Introduce a dynamic partitioning framework for distributed parallel simulation under OD variations. • Conduct empirical validation of distributed parallel simulation on six large-scale road networks.
Journal
T
IF:
0
Papers:
247
Citations:
0