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

Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
30
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 93 publications
(30 citation statements)
references
References 78 publications
0
30
0
Order By: Relevance
“…Second, the MILP model and the heuristic algorithm GSAHA proposed in this paper can be further developed to consider different station types, such as the terminal station where trains need to perform the turnaround movement that makes the train platforming problem more complicated [42,43]. ird, the train movements at the stations can be viewed as a set of space-time paths, and thus more efficient dual decomposition methods could be developed accordingly [7,44,45]. Fourth, more efficient solution algorithms can be developed for the simultaneous reoptimization of several interconnected railway stations in a railway line or even a regional railway network with more complicated structure so that the joint optimization of delay situations and train timetabling problems can be achieved [8,19,27,[46][47][48][49].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Second, the MILP model and the heuristic algorithm GSAHA proposed in this paper can be further developed to consider different station types, such as the terminal station where trains need to perform the turnaround movement that makes the train platforming problem more complicated [42,43]. ird, the train movements at the stations can be viewed as a set of space-time paths, and thus more efficient dual decomposition methods could be developed accordingly [7,44,45]. Fourth, more efficient solution algorithms can be developed for the simultaneous reoptimization of several interconnected railway stations in a railway line or even a regional railway network with more complicated structure so that the joint optimization of delay situations and train timetabling problems can be achieved [8,19,27,[46][47][48][49].…”
Section: Discussionmentioning
confidence: 99%
“…We refer the readers to Assad [3], Cordeau [4], and Lusby et al [2] for excellent surveys on the related optimization methods. In general, train timetabling stage can determine the arrival and departure times of the trains at each of the visiting stations from an aggregate perspective [5][6][7][8]. Train operations at the stations, including the train routing on the arrival and departure routes and the train platform assignment decisions, are usually optimized by solving the train platforming problem [8].…”
Section: Introductionmentioning
confidence: 99%
“…For example, the probability of station failures can be determined by historical data, and the reliability of a URT network can be evaluated from the travel quality of passengers. In the future, the reliability of URT operations can be further improved by combining the connectivity reliability analysis with the optimization of train timetabling (Zhang et al [29,30]) and rolling stock scheduling (Zhong et al [31]) of URT networks.…”
Section: Discussionmentioning
confidence: 99%
“…In addition to standard off-line TTPs, certain models are also used for real time (online) timetabling under disturbances, i.e., operational planning such as the models by Törnquist and Persson (2007), Törnquist (2012) or Quaglietta et al (2016). The final timetables can have a specific format, e.g., cyclic as in Zhang et al (2019b) or periodic as in Jamili et al (2012).…”
Section: Related Workmentioning
confidence: 99%