An efficient sequencing model for humping in a rail yard

https://doi.org/10.1016/0191-2607(83)90089-4Get rights and content

Abstract

A computer model for sequencing trains into the rail yard humping process is presented. The algorithm, named HSS, consists of two main components: a screening technique and a detailed cost minimization procedure for the humping and assembly phases. The screening technique reduces the number of likely candidates for priority humping from a large number of available inbound trains in the receiving yard. The model establishes an efficient hump sequence by promoting both compatibility between inbound trains and departure trains as well as operator service priorities. Dynamic programming is used to minimize overall rail yard throughout costs for a given interval of operation. The screening technique is illustrated with the use of two simple examples. In addition, an example pilot study illustrates the sequencing of eight real trains at the CN Taschereau Rail Yard in Montreal according to the following three methods of operation: FIFO, current operation, and the proposed HSS model. Comparison of these pilot results indicates that the HSS model is very promising.

References (4)

  • M.M. Allen et al.

    Rail terminal sequencing system

    Canadian Transport Forum

    (1978)
  • W.J. Salmond

    Sequencing of Trains in a Railway Hump Yard

    (1970)
There are more references available in the full text version of this article.

Cited by (45)

  • Transportation Engineering: Theory, Practice, and Modeling

    2022, Transportation Engineering: Theory, Practice, and Modeling
  • Adaptive large neighborhood search for integrated planning in railroad classification yards

    2021, Transportation Research Part B: Methodological
    Citation Excerpt :

    In strict single-stage sorting problems, each railcar is humped only once. The most noteworthy contributions to this problem are Yagar et al. (1983) and Jaehn et al. (2015). The problem of extended single-stage sorting, where rehumpings are allowed in some cases, has been investigated in three papers by Kraft (Kraft, 2000; 2002a; 2002b).

  • A rolling horizon optimisation model for consolidated hump yard operational planning

    2019, Journal of Rail Transport Planning and Management
    Citation Excerpt :

    Below we present a brief summary of studies relevant to our problem setting. Yagar et al. (1983) presented an algorithm to select a subset of inbound trains for humping, according to load and priority. The selected trains were then sequenced using a dynamic programming approach to minimise throughput cost.

  • Single-stage shunting minimizing weighted departure times

    2015, Omega (United Kingdom)
    Citation Excerpt :

    Otherwise a ranking procedure determines a set of trains suitable for being humped next. Contrary to the problem at hand, Yagar et al. [18] consider outbound trains with a given departure time. Therefore, the proposed approach cannot be applied to our problem at hand.

View all citing articles on Scopus
View full text