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

Multi-periodic train timetabling using a period-type-based Lagrangian relaxation decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 42 publications
0
14
0
Order By: Relevance
“…Two versions of this problem exist: cyclic and non-cyclic. In the cyclic TTP (Peeters (2003), Zhou et al (2017), Sparing and Goverde (2017), for instance), the main focus is on the cyclicity constraints, whereas in the non-cyclic TTP (Caprara et al (2002)) the departure times do not have to follow any specific pattern. Traditionally, both problems assume that the passengers follow the shortest path.…”
Section: Demand Representationsmentioning
confidence: 99%
“…Two versions of this problem exist: cyclic and non-cyclic. In the cyclic TTP (Peeters (2003), Zhou et al (2017), Sparing and Goverde (2017), for instance), the main focus is on the cyclicity constraints, whereas in the non-cyclic TTP (Caprara et al (2002)) the departure times do not have to follow any specific pattern. Traditionally, both problems assume that the passengers follow the shortest path.…”
Section: Demand Representationsmentioning
confidence: 99%
“…Zhou et al. () focused on the multiperiodic train timetabling problem on a double‐track rail network.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (16) and (20) can secure the safety interval for train and train i+1 after the overtaking station . Likewise, the constraints (17) and (21) can secure the safety interval for train i−1 and train i+1 after the overtaking station m, and the constraints (18) and (22) can secure the safety interval for train and train i+2 after the overtaking station m. The constraints (24) ensure that train can be overtaken by train i+1 at most once.…”
Section: Fix Service Order Allowing Overtaking Model M2mentioning
confidence: 99%
“…Caimi [16,17] developed a timetable model with partial periodicity. Zhou [18] modeled the multiperiodic train timetabling problem to simultaneously optimize operation periods, arrival times, and departure times of various types of trains of all periods. A cyclic train timetable is easier and more convenient for passengers to remember exactly the arrival times and the departure times.…”
Section: Introductionmentioning
confidence: 99%