EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimizing Railcar Shunting Operations to Create Outbound Trains in a Stub Yard

Ruonan Zhao, Joseph Geunes, Xiaofeng Nie

Naval Research Logistics (NRL) · 19.11.2026

DOI: 10.1002/nav.70111 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Naval Research Logistics (NRL), online erschienen am 19.11.2026. Verfasst von Ruonan Zhao und 2 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A typical freight railyard contains multiple tracks used for storage, classification, and outbound train assembly. In a railyard with a stub configuration, classification tracks are only accessible from one end of the track, requiring retrieval of railcars in last‐in, first‐out order when assembling outbound trains. Individual railcar storage locations on classification tracks are often determined before knowledge of their destination locations is known, giving rise to railcar shunting or switching problems that require retrieving subsets of cars distributed throughout the yard to assemble outbound trains. To address this combinatorially challenging problem class, we propose a large‐scale mixed‐integer programming model that tracks railcar movements and corresponding costs over a finite planning horizon. The model permits simultaneous movement of multiple car groups via a locomotive and seeks to minimize repositioning costs. We also provide a dynamic programming formulation of the problem, demonstrate the ‐hardness of the corresponding optimization problem, and present an adaptive railcar grouping dynamic programming (ARG‐DP) heuristic, which groups railcars with common destinations for efficient moves. Average results from a series of numerical experiments demonstrate the efficiency and quality of the ARG‐DP algorithm in both simulated yards and a real yard. On average, across 60 test cases of simulated yards, the ARG‐DP algorithm obtains solutions 355 times faster than solving the mixed‐integer programming model using a commercial solver, while finding an optimal solution in of the instances and maintaining an average optimality gap of 6.65%. In 10 cases based on the Gaia railyard in Portugal, the ARG‐DP algorithm achieves solutions 229 times faster on average, finding an optimal solution in of the instances with an average optimality gap of 6.90%.

Zitieren

APA

Zhao, R., Geunes, J., & Nie, X. (2026). Optimizing Railcar Shunting Operations to Create Outbound Trains in a Stub Yard. Naval Research Logistics (NRL). https://doi.org/10.1002/nav.70111

Vancouver

Zhao R, Geunes J, Nie X. Optimizing Railcar Shunting Operations to Create Outbound Trains in a Stub Yard. Naval Research Logistics (NRL). 2026. doi:10.1002/nav.70111

BibTeX
@article{Zhao2026,
  author = {Zhao, Ruonan and Geunes, Joseph and Nie, Xiaofeng},
  title = {Optimizing Railcar Shunting Operations to Create Outbound Trains in a Stub Yard},
  journal = {Naval Research Logistics (NRL)},
  year = {2026},
  doi = {10.1002/nav.70111}
}
Kostenlos starten →