2013
DOI: 10.1007/s11771-013-1811-5
|View full text |Cite
|
Sign up to set email alerts
|

Modified stochastic user-equilibrium assignment algorithm for urban rail transit under network operation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…The traffic assignment model should be applied to determine the passenger flow via stations. Some studies allocate passenger trips on a URT network considering the constrained capacity caused by the train, platform and transfer corridor [24,25], while others employ a user stochastic equilibrium model to allocate passenger trips on the network [26,27]. In this paper, the RAPV of stations can be calculated simply by determining the passenger flow via stations.…”
Section: Identifying Important Stationsmentioning
confidence: 99%
“…The traffic assignment model should be applied to determine the passenger flow via stations. Some studies allocate passenger trips on a URT network considering the constrained capacity caused by the train, platform and transfer corridor [24,25], while others employ a user stochastic equilibrium model to allocate passenger trips on the network [26,27]. In this paper, the RAPV of stations can be calculated simply by determining the passenger flow via stations.…”
Section: Identifying Important Stationsmentioning
confidence: 99%
“…For example, Si et al [11] presented an urban transit assignment model based on augmented network with both the in-vehicle congestion and transfer congestion and developed an improved shortest path-based algorithm to solve it. Zhu et al [12] presented a modified stochastic user-equilibrium assignment algorithm to calculate the passenger flow distribution for network operations. Though the impacts of in-vehicle congestion on passengers began to be considered, how to mitigate in-vehicle congestion is not the focus of these studies.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, the K-shortest route approach only adapts well to the condition of K ≤ 3 due to the repeated iterations, and Dial algorithm would skip over some routes when the metro system has a loop [11,18,19]. Hence, a deletion algorithm (DA) based on the depth-first traversal (DFT) method is used to find the set of effective routes for any given OD pair, as applied in [12,19]. The core feature of DA is to find the next alternative shortest route by deleting a link on the existing shortest route in the directed graph and searching for a replacement link.…”
Section: Set Of Effective Alternative Routesmentioning
confidence: 99%
“…Zhu [5] used the method of successive averages to solve the stochastic user-equilibrium problem. He/she described the impact of congestion on passengers' route choices.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Quite a few studies [5][6][7][8] have focused on passenger flow assignment in URT network. User-equilibrium model and discrete choice model are the most commonly used methods in passenger flow assignment.…”
Section: Introductionmentioning
confidence: 99%