A branch and bound algorithm for scheduling trains in a railway network

The paper studies a train scheduling problem faced by railway infrastructure managers during real-time traffic control. When train operations are perturbed, a new conflict-free timetable of feasible arrival and departure times needs to be re-computed, such that the deviation from the original one is...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 183; číslo 2; s. 643 - 657
Hlavní autoři: D’Ariano, Andrea, Pacciarelli, Dario, Pranzo, Marco
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.12.2007
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Algorithms
Alternative graph
Applied sciences
Branch & bound algorithms
Branch and bound algorithm
Exact sciences and technology
Job shops
Operational research and scientific management
Operational research. Management science
Railway networks
Real-time conflict resolution
Scheduling
Scheduling, sequencing
Studies
Traffic control
Train scheduling
Trains
Netherlands
Real-time conflict resolution
Alternative graph
Branch and bound algorithm
Train scheduling
Bottleneck
Optimal algorithm
Branch and bound method
Conflict resolution
Job shop
Traffic controller
Task scheduling
Railway network
Scheduling
Real time
Modeling
Workload
Arrival time
Minimum time
Traffic management
Rail transportation
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paper studies a train scheduling problem faced by railway infrastructure managers during real-time traffic control. When train operations are perturbed, a new conflict-free timetable of feasible arrival and departure times needs to be re-computed, such that the deviation from the original one is minimized. The problem can be viewed as a huge job shop scheduling problem with no-store constraints. We make use of a careful estimation of time separation among trains, and model the scheduling problem with an alternative graph formulation. We develop a branch and bound algorithm which includes implication rules enabling to speed up the computation. An experimental study, based on a bottleneck area of the Dutch rail network, shows that a truncated version of the algorithm provides proven optimal or near optimal solutions within short time limits.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2006.10.034