2013
DOI: 10.1016/j.jrtpm.2013.10.001
|View full text |Cite
|
Sign up to set email alerts
|

A demand-based weighted train delay approach for rescheduling railway networks in real time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
22
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 32 publications
(22 citation statements)
references
References 29 publications
0
22
0
Order By: Relevance
“…The overall problem of controlling trains is split into subproblems along the time dimension (i.e., controlling only a slice in time of the problem), but only for combinatorial purposes [30], [66]; in some limited case [9], this also addresses limited information available. At every stage, the solver knows completely the future within the stage [6], [23], [66], [71].…”
Section: A Complete Knowledge Of the Futurementioning
confidence: 99%
“…The overall problem of controlling trains is split into subproblems along the time dimension (i.e., controlling only a slice in time of the problem), but only for combinatorial purposes [30], [66]; in some limited case [9], this also addresses limited information available. At every stage, the solver knows completely the future within the stage [6], [23], [66], [71].…”
Section: A Complete Knowledge Of the Futurementioning
confidence: 99%
“…References [5] and [7] also demonstrate that integrated models provide better solutions for problems within the railway industry. Reference [13] presents a novel weighted train delay based on demand approach for rescheduling railway systems. Reference [16] describes a real-time rolling stock rescheduling model for disruption management which takes dynamic passenger flows into account.…”
Section: State Of Artmentioning
confidence: 99%
“…Chevrier et al [15] explored the energy-efficient timetabling problem using multiobjective evolution approach. Espinosa-Aranda and García-Ródenas [16] put up a heuristic algorithm using alternative arcs to minimize the traveling delay time. Li et al [17] proposed the greedy algorithm to solve the train rescheduling problem with random delay.…”
Section: Introductionmentioning
confidence: 99%