The basic train makeup problem in shunting yards

In shunting yards, railcars of incoming trains are uncoupled and reassembled to outbound trains. This time-critical process that employs a complex system of switches, hump hills, and classification tracks requires plenty interdependent decision problems to be solved. An elementary decision task among these is the train makeup problem, which assigns railcars of inbound freight trains to outbound trains, such that the priority values of the selected cuts of railcars are maximized and given train capacities are observed. This assignment decision is further complicated by the fact that railcars cannot facultatively be selected, but the buildup sequences of incoming trains need to be considered. This work introduces and discusses the basic train makeup problem, analyses its complexity status and develops suited exact and heuristic solution procedures that are tested in a comprehensive computational study.

[1]  Gabriele Di Stefano,et al.  A Graph Theoretical Approach To The Shunting Problem , 2004, Electron. Notes Theor. Comput. Sci..

[2]  Günther R. Raidl,et al.  The Multidimensional Knapsack Problem: Structure and Algorithms , 2010, INFORMS J. Comput..

[3]  Sohail S. Chaudhry,et al.  An integrated dispatching model for rail yards operations , 2003, Comput. Oper. Res..

[4]  Hugo Priemus,et al.  Breakthrough innovations in intermodal freight transport , 2004 .

[5]  Mirka Miller,et al.  The train marshalling problem , 2000, Discret. Appl. Math..

[6]  Matús Mihalák,et al.  Shunting for Dummies: An Introductory Algorithmic Survey , 2009, Robust and Online Large-Scale Optimization.

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

[8]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[9]  Hadas Shachnai,et al.  Approximation Schemes for Packing with Item Fragmentation , 2007, Theory of Computing Systems.

[10]  Sam Yagar,et al.  An efficient sequencing model for humping in a rail yard , 1983 .

[11]  Nils Boysen,et al.  A Survey on Container Processing in Railway Yards , 2011, Transp. Sci..

[12]  John Golias,et al.  Comparative evaluation of existing and innovative rail-road freight transport terminals , 2002 .

[13]  Sohail S. Chaudhry,et al.  Fuzzy dispatching model and genetic algorithms for railyards operations , 2000, Eur. J. Oper. Res..

[14]  Randolph W. Hall,et al.  Railroad classification yard throughput: The case of multistage triangular sorting☆ , 1983 .

[15]  Raphael Rom,et al.  Bin Packing with Item Fragmentation , 2001, WADS.

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

[17]  E. R. Petersen.  Railyard Modeling: Part I. Prediction of Put-Through Time , 1977 .

[18]  E R Kraft.  A HUMP SEQUENCING ALGORITHM FOR REAL TIME MANAGEMENT OF TRAIN CONNECTION RELIABILITY , 2000 .

[19]  Leo G. Kroon,et al.  Shunting of Passenger Train Units: An Integrated Approach , 2006, Transp. Sci..

[20]  R. Reddy,et al.  The Harpy Speech Recognition System: performance with large vocabularies , 1976 .

[21]  Toru Nakamura.  WHITE PAPER, European transport policy for 2010 : time to decide , 2004 .

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

[23]  Anna-Maria Lekka,et al.  Assessment of a transport policy potential for intermodal mode shift on a European scale , 2007 .

[24]  H. Martin Weingartner,et al.  Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem , 2015 .

[25]  Uwe T. Zimmermann,et al.  Shunting Minimal Rail Car Allocation , 2005, Comput. Optim. Appl..

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

[27]  Arnaud Fréville,et al.  The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..

[28]  Hadas Shachnai,et al.  Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs , 2007, FCT.