Shunting of trains in succeeding yards

Abstract We consider a problem arising in international rail freight transport. At a shunting yard, inbound trains are taken apart by decoupling freight cars, which are then sent through a system of tracks and switching points to form new outbound trains. Each freight car has a designated outbound train, but each outbound train might consist of freight cars going to different final destinations. Therefore, the outbound trains will be decoupled and rearranged in succeeding shunting yards. If two freight cars with the same final destination end up in an outbound train such that a freight car with a different destination is positioned in-between, additional shunting efforts at succeeding shunting yards are involved. Especially if the succeeding shunting yard is located in a foreign country, the rail company will be charged for every shunting procedure performed by the foreign operator. Therefore, such a situation should be reduced as far as possible. To do so, we may determine the shunting sequence of inbound trains. We will show that this problem is NP-hard and various mixed integer programming models are presented and implemented in CPLEX. Further, a heuristic solution algorithm is suggested. The computation time and the quality of the results are compared to the results of the CPLEX optimizer in a computational study.

[1]  Wendell Fletcher,et al.  Transportation Statistics Annual Report 1997: Mobility and Access , 1997 .

[2]  D. J. Rosenkrantz,et al.  Approximate Algorithms for the Traveling Salesperson Problem , 1974, SWAT.

[3]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[4]  Florian Jaehn,et al.  Minimizing delays in a shunting yard , 2015, OR Spectr..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Malachy Carey,et al.  Testing schedule performance and reliability for train stations , 2000, J. Oper. Res. Soc..

[7]  Ronny S. Hansmann,et al.  Optimal Sorting of Rolling Stock at Hump Yards , 2008 .

[8]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[9]  Sara Gestrelius,et al.  Optimal Freight Train Classification using Column Generation , 2012, ATMOS.

[10]  Nils Boysen,et al.  Shunting yard operations: Theoretical aspects and applications , 2012, Eur. J. Oper. Res..

[11]  Christina Büsing,et al.  Robust Algorithms for Sorting Railway Cars , 2010, ESA.

[12]  Sara Gestrelius,et al.  Evaluation of planning policies for marshalling track allocation using simulation , 2012 .

[13]  E. Pesch,et al.  Operation of shunting yards: train-to-yard assignment problem , 2017 .

[14]  Teodor Gabriel Crainic,et al.  Improving the performance of rail yards through dynamic reassignments of empty cars , 2009 .

[15]  Markus Bohlin,et al.  Optimized shunting with mixed-usage tracks , 2013 .

[16]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[17]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[18]  Riko Jacob,et al.  Multistage methods for freight train classification , 2007, Networks.

[19]  Chao-Hsien Pan,et al.  A study of integer programming formulations for scheduling problems , 1997, Int. J. Syst. Sci..

[20]  Matús Mihalák,et al.  Track Allocation in Freight-Train Classification with Mixed Tracks , 2011, ATMOS.

[21]  Alexandra M. Newman,et al.  Practical Guidelines for Solving Difficult Mixed Integer Linear , 2013 .

[22]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[23]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[24]  Sara Gestrelius,et al.  Optimisation of simultaneous train formation and car sorting at marshalling yards , 2013 .

[25]  George Z. Li.  Single machine earliness and tardiness scheduling , 1997 .

[26]  Moshe Dror,et al.  Mathematical programming formulations for machine scheduling: A survey , 1991 .

[27]  Jørgen Thorlund Haahr,et al.  A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards , 2016, Networks.

[28]  Daniele Frigioni,et al.  Recoverable Robustness for Train Shunting Problems , 2009, Algorithmic Oper. Res..