A Novel Hybrid Heuristic–Reinforcement Learning Optimization Approach for a Class of Railcar Shunting Problems
Preprint
- 11 March 2026
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
Railcar shunting is a core planning task in freight railyards, where yard planners need to disassemble and reassemble groups of railcars to form outbound trains. Classification trackswith access from one side only can be considered as stack structures, where railcars are added and removed from only one end, leading to a last-in-first-out (LIFO) retrieval order. In contrast, two-sided tracks function like queue structures, allowing railcars to be added from one end and removed from the opposite end, following a first-in-first-out (FIFO) order. We consider a problem requiring assembly of multiple outbound trains using two locomotives in a railyard with two-sided classification track access. To address this combinatorially challenging problem class, we decompose the problem into two subproblems, each with one-sided classification track access and a locomotive on each side. We present a novel Hybrid Heuristic–Reinforcement Learning (HHRL) framework that integrates railway-specific heuristic solution approaches with a reinforcement learning method, specifically Q-learning. The proposed framework leverages methods to decrease the state-action space and guide exploration during reinforcement learning. The results of a series of numerical experiments demonstrate the efficiency and quality of the HHRL algorithm in both one-sided access, single-locomotive problems and two-sided access, two-locomotive problemsKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Optimal management of full train load services in the shunting yard: A comprehensive study on Shunt-In Shunt-Out policiesComputers & Industrial Engineering, 2023
- Solution algorithms for the generalized train unit shunting problemEURO Journal on Transportation and Logistics, 2021
- Mathematical formulation and heuristic algorithm for the block relocation and loading problemNaval Research Logistics (NRL), 2019
- Shunting of trains in succeeding yardsComputers & Industrial Engineering, 2016
- Solving the container relocation problem by an improved greedy look-ahead heuristicEuropean Journal of Operational Research, 2015
- Robust railway station planning: An interaction between routing, timetabling and platformingJournal of Rail Transport Planning & Management, 2013
- Shunting yard operations: Theoretical aspects and applicationsEuropean Journal of Operational Research, 2012
- Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problemComputers & Operations Research, 2010
- Shunting Minimal Rail Car AllocationComputational Optimization and Applications, 2005
- QUEUES, STACKS AND GRAPHS1971