Train design and routing optimization for evaluating criticality of freight railroad infrastructures

•Evaluation of criticality of freight rail infrastructure with optimization.•New optimization model and solution method to route freight rail traffic considering congestion and capacity at links and yards along with various operational constraints.•A case study to show the criticality level of infra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation research. Part B: methodological 2015-01, Vol.71, p.71-84
Hauptverfasser: Khaled, Abdullah A., Jin, Mingzhou, Clarke, David B., Hoque, Mohammad A.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Evaluation of criticality of freight rail infrastructure with optimization.•New optimization model and solution method to route freight rail traffic considering congestion and capacity at links and yards along with various operational constraints.•A case study to show the criticality level of infrastructure of one Class-I railroad in the US. Freight transportation by railroads is an integral part of the U.S. economy. Identifying critical rail infrastructures can help stakeholders prioritize protection initiatives or add necessary redundancy to maximize rail network resiliency. The criticality of an infrastructure element, link or yard, is based on the increased cost (delay) incurred when that element is disrupted. An event of disruption can cause heavy congestion so that the capacity at links and yards should be considered when freight is re-routed. This paper proposes an optimization model for making-up and routing of trains in a disruptive situation to minimize the system-wide total cost, including classification time at yards and travel time along links. Train design optimization seeks to determine the optimal number of trains, their routes, and associated blocks, subject to various capacity and operational constraints at rail links and yards. An iterative heuristic algorithm is proposed to attack the computational burden for real-world networks. The solution algorithm considers the impact of volume on travel time in a congested or near-congested network. The proposed heuristics provide quality solutions with high speed, demonstrated by numerical experiments for small instances. A case study is conducted for the network of a major U.S. Class-I railroad based on publicly available data. The paper provides maps showing the criticality of infrastructure in the study area from the viewpoint of strategic planning.
ISSN:0191-2615
1879-2367
DOI:10.1016/j.trb.2014.10.002