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

Rescheduling rail networks with maintenance disruptions using Problem Space Search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0
1

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 108 publications
(52 citation statements)
references
References 14 publications
0
44
0
1
Order By: Relevance
“…Paper [15] summarizes 3 rules for the events dispatching. A first-to-start dispatcher selects the next train to be moved based on the earliest start time.…”
Section: ) Rescheduling Methodsmentioning
confidence: 99%
“…Paper [15] summarizes 3 rules for the events dispatching. A first-to-start dispatcher selects the next train to be moved based on the earliest start time.…”
Section: ) Rescheduling Methodsmentioning
confidence: 99%
“…Approaches for scheduling both trains and work possessions in the same model are presented in Ruffing (1993), Albrecht et al (2013) and Forsgren et al (2013). In all cases, a small number of maintenance possessions shall be introduced into an existing train timetable, by allowing different types of adjustments to the trains.…”
Section: Combined Approachesmentioning
confidence: 99%
“…Ruffing (1993) is one of few papers that handle operational restrictions (reduced speed) for trains passing a work site. Albrecht et al (2013) address the real-time operational control case for a single track line, treat maintenance as pseudo trains and allow train times to be adjusted but not cancelled. A probabilistic meta-heuristic procedure (Problem Space Search) is used for obtaining high quality solutions quickly.…”
Section: Combined Approachesmentioning
confidence: 99%
“…In this approach, existing timetables are fed in and then optimised while still allowing timetable planners to make their own adjustments. Albrecht et al 41 take an approach to timetable revision that involves the use of a problem space search heuristic to generate alternative solutions. This approach is particularly relevant to re-scheduling situations due to track and infrastructure maintenance needs.…”
Section: Timetable Planningmentioning
confidence: 99%