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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 183; H. 2; S. 643 - 657
Hauptverfasser:	D’Ariano, Andrea, Pacciarelli, Dario, Pranzo, Marco
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.12.2007 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!