.png){kind=icon}
返回
An efficient hyperpath-based algorithm for the capacitated transit equilibrium assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1080/23249935.2024.2326819.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studied the capacitated transit equilibrium assignment problem (CTEAP), which particularly accounts for the capacity effect that impacts passengers' route choices in a transit network. Specifically, we impose strict capacity constraints on line segments to ensure that the passenger flow does not exceed the line capacity. By introducing associated Lagrange multipliers, we derived the generalised hyperpath cost function and established an equivalent variational inequality formulation. A solution framework is developed to solve CTEAP based on the Method of Multipliers. To handle destroyed Cartesian product structures, we transformed the master problem into a sequence of uncapacitated subproblems, which can be tackled by two modified Newton-type hyperpath-based algorithms. Numerical analyses were performed for a small Gentile network and a large Shenzhen transit network to evaluate the impacts of the capacity constraint on passenger flows and computation costs. Our results demonstrate the superiority of the proposed CTEAP model to prevent over-loaded flows, and show the promise of applying the hyperpath-based algorithm in the implementation of real-world networks.
Keyword:
Transit assignment
capacity constraint
hyperpath
variational inequality
期刊
IF:
3.1
论文数:
938
被引数:
2.2K
机构
引用论文
On the Convergence of the Method of Successive Averages for Calculating Equilibrium in Traffic Networks关于交通网络中计算平衡的连续平均方法的收敛性
OAAI
.png){kind=icon}
OAAI分享收藏Sensitivity analysis for transit equilibrium assignment and applications to uncertainty analysis
PREAI
分享收藏分享收藏
查看更多内容