2008
DOI: 10.1016/j.trb.2007.11.005
|View full text |Cite
|
Sign up to set email alerts
|

Schedule-based transit assignment model with travel strategies and capacity constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
75
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 125 publications
(76 citation statements)
references
References 18 publications
0
75
0
Order By: Relevance
“…13 and Fig. 14), the inflow on queuing arcs (1, 21) and (1, 22) at Stop 1 and (2, 23) and (2,24) at Stop 2 stays constant during all the analysis period. …”
Section: Model Implementation and Numerical Examplesmentioning
confidence: 84%
See 1 more Smart Citation
“…13 and Fig. 14), the inflow on queuing arcs (1, 21) and (1, 22) at Stop 1 and (2, 23) and (2,24) at Stop 2 stays constant during all the analysis period. …”
Section: Model Implementation and Numerical Examplesmentioning
confidence: 84%
“…A schedule-based approach has also been used [17,18,24] to represent the behaviour of passengers that choose a ranked set of runs (that make up an ordered set of "back-up travel plans") and know that, at each intermediate stop, they may not be able to board the best option, or that they may not be able to sit, because of capacity constraints. Thus, in this case the concept of hyperpath is applied to a different scenario: passengers know and trust the service timetable (this is one of the basic assumptions of schedule-based models) and can precisely select their best travel option; however, it is uncertain if they will be able to board/sit when congestion occurs.…”
Section: Background Research On Transit Congestionmentioning
confidence: 99%
“…A "fail-to-sit" probability is introduced at boarding points with travel costs without relying on a firstcome-first-serve (FCFS) principle for many crowded buses in European countries [11]. A schedulebased equilibrium model is proposed assuming passengers use their own individual strategies [7]. …”
Section: In-fbs Congested Costmentioning
confidence: 99%
“…These model objectives are minimizing the total expected travel and waiting time [5][6][7] perceived total travel times [8], expected travel cost [9,10], general cost [11] (including; in-vehicle time, waiting time, walking time, a line change penalty), total vehicle operation cost [12], optimize transit lines timetables with fleet size and vehicle services [13], utility maximization [14]. Transit assignment models are solved with the gradient projection method, minimum cost hyperpath search algorithm, method of successive averages algorithm, iterated local search algorithm and Newton method.…”
Section: Transit Assignmentmentioning
confidence: 99%