EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Dynamic Optimisation Method of Empty Train Allocation for Heavy Haul Railway

Miaomiao Lv, Haozheng Gan, Meng Wang, Taojun Feng, Zhiyuan Li, Jingchun Geng

IET Intelligent Transport Systems · 2026-01 · 20 (1)

DOI: 10.1049/itr2.70277 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IET Intelligent Transport Systems, online erschienen am 03.07.2026. Verfasst von Miaomiao Lv und 5 weiteren Autor:innen. Die Arbeit nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Heavy haul railway empty train allocation is the process of sending empty trains from downstream unloading stations to upstream loading stations to meet their loading demands. In daily freight operations of heavy haul railways, fluctuations in the freight market demand may cause changes in loading demands, necessitating dynamic updates to the corresponding loading plans, which render the initial empty train allocation plan incapable of accurately matching the dynamically updated loading plans. To address this problem, we proposed a dynamic method for formulating an empty train allocation plan on heavy haul railways. Firstly, we generated the initial empty allocation plan based on the initial loading plan. Next, we obtained real‐time freight market demand information through the Freight Information System and updated the loading plan. To meet the loading demand corresponding to the updated loading plan while increasing the concentration of empty train flow destinations, we established an optimisation model for dynamically formulating a heavy haul railway empty train allocation plan, with the objective of minimising the delay time in satisfying the upstream loading station demand. Then, we designed an improved two‐stage algorithm based on recursive outlier filtering for K‐means++ clustering and an improved differential evolution algorithm based on the empty train destination concentration operator to solve the model. Finally, we took the Baoshen heavy haul railway as a case study for instance verification. Compared to the initial empty train allocation plan, the optimised plan results in a 13.4% reduction of the objective function value to 976 min (a decrease of 151 min) and a 109.38% increase in the concentration of empty train flow destinations to 0.67 (an increase of 0.35).

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Lv, M., Gan, H., Wang, M., Feng, T., Li, Z., & Geng, J. (2026). A Dynamic Optimisation Method of Empty Train Allocation for Heavy Haul Railway. IET Intelligent Transport Systems, 20(1). https://doi.org/10.1049/itr2.70277

Vancouver

Lv M, Gan H, Wang M, Feng T, Li Z, Geng J. A Dynamic Optimisation Method of Empty Train Allocation for Heavy Haul Railway. IET Intelligent Transport Systems. 2026;20(1). doi:10.1049/itr2.70277

BibTeX
@article{Lv2026,
  author = {Lv, Miaomiao and Gan, Haozheng and Wang, Meng and Feng, Taojun and Li, Zhiyuan and Geng, Jingchun},
  title = {A Dynamic Optimisation Method of Empty Train Allocation for Heavy Haul Railway},
  journal = {IET Intelligent Transport Systems},
  year = {2026},
  volume = {20},
  number = {1},
  doi = {10.1049/itr2.70277}
}
Kostenlos starten →