Combinatorial Optimization of Shunting Operations for Industrial Sidings Adjacent to Railway Stations
Abstract
The main objective of this study was to reduce the dwell time of wagons at stations and to improve the efficiency of shunting locomotive utilization. This is a combinatorial problem, since an increase in the number of loading and unloading fronts leads to a sharp growth in the number of feasible service variants. During the research, a mathematical model describing the servicing process of industrial sidings was developed. This study addressed the problem of determining the optimal sequence of wagon deliveries and the optimal distribution of workload among shunting locomotives. For conditions under which two or more shunting locomotives are used, an optimization method based on the indicator of wagon-hour reduction (σ) was proposed for allocating loading and unloading fronts. Using combinatorial properties, it was shown that many possible allocation variants are symmetric, which allowed for the development of a mathematical solution that simplifies the search for an optimal solution. Computational results demonstrated that, at the hypothetical railway station “N-1”, applying the optimal service sequence reduces wagon dwell time by 21% compared with an arbitrary sequence. At the hypothetical station “N-2”, distributing wagon groups between two shunting locomotives improves the efficiency of the servicing process by 26% compared with using a single locomotive. The results based on real data from the “B-2” railway station show that the proposed method provides an improvement of approximately 31.3% compared to the current operational practice, while Smith’s rule achieves an improvement of 14.9%. Based on the proposed model and algorithm, a software tool was developed to automatically determine servicing sequences for loading and unloading fronts, analyze alternatives, and evaluate shunting locomotive efficiency.