Real-time freight locomotive rescheduling and uncovered train detection during disruption

► We model locomotive rescheduling for real, large-scale disruptions as MIP. ► A set-covering relaxation to a set-partitioning constraint is proposed. ► A shortest path with a periodic inspection constraint is found in polynomial time. ► Almost optimal solutions are obtained in 30s for Japanese inst...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research 2012-09, Vol.221 (3), p.636-648
Hauptverfasser:	Sato, Keisuke, Fukumura, Naoto
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Column generation Constrained shortest path Disruption Exact sciences and technology Freight trains Ground, air and sea transportation, marine construction Inspection Integer programming Locomotives Mathematical models Mathematical programming Operational research and scientific management Operational research. Management science Railroad transportation Railway transportation and traffic Real-time locomotive rescheduling Rescheduling Scheduling Scheduling, sequencing Set-covering relaxation Shortest path algorithms Studies Timetables Trains Transportation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!