An efficient sequencing model for humping in a rail yard
References (4)
- et al.
Rail terminal sequencing system
Canadian Transport Forum
(1978) Sequencing of Trains in a Railway Hump Yard
(1970)
Cited by (45)
Optimal resource rescheduling in classification yards considering flexible skill patterns
2023, Journal of Rail Transport Planning and ManagementTransportation Engineering: Theory, Practice, and Modeling
2022, Transportation Engineering: Theory, Practice, and ModelingInfluence of mainline schedule flexibility and volume variability on railway classification yard performance
2021, Journal of Rail Transport Planning and ManagementAdaptive large neighborhood search for integrated planning in railroad classification yards
2021, Transportation Research Part B: MethodologicalCitation 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 ManagementCitation 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.