Shunting for Dummies: An Introductory Algorithmic Survey

In this survey we present a selection of commonly used and new train classification methods from an algorithmic perspective.

[1]  Carlos F. Daganzo,et al.  Static Blocking at Railyards: Sorting Implications and Track Requirements , 1986, Transp. Sci..

[2]  Marc Nunkesser,et al.  An Improved Train Classification Procedure for the Hump Yard Lausanne Triage , 2009, ATMOS.

[3]  M W Siddiqee.  INVESTIGATION OF SORTING AND TRAIN FORMATION SCHEMES FOR A RAILROAD HUMP YARD , 1971 .

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

[5]  Michael R. Bussieck,et al.  Scheduling trams in the morning , 1999, Math. Methods Oper. Res..

[6]  Benjamin Leroy-Beaulieu,et al.  Some coloring and walking problems in graphs , 2008 .

[7]  Gabriele Di Stefano,et al.  On minimum k-modal partitions of permutations , 2006, J. Discrete Algorithms.

[8]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[9]  Robert E. Tarjan,et al.  Sorting Using Networks of Queues and Stacks , 1972, J. ACM.

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

[11]  Daniele Frigioni,et al.  Recoverable Robustness in Shunting and Timetabling , 2009, Robust and Online Large-Scale Optimization.

[12]  Gabriele Di Stefano,et al.  Online Bounded Coloring of Permutation and Overlap Graphs , 2008, Electron. Notes Discret. Math..

[13]  Marco E. Lübbecke,et al.  Sorting with Complete Networks of Stacks , 2008, ISAAC.

[14]  Daniele Frigioni,et al.  Robust Algorithms and Price of Robustness in Shunting Problems , 2007, ATMOS.

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

[16]  Rolf H. Möhring,et al.  The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.

[17]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[18]  Vaughan R. Pratt,et al.  Computing permutations with double-ended queues, parallel stacks and parallel queues , 1973, STOC.

[19]  Rolf H. Möhring,et al.  Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems , 2009, Robust and Online Large-Scale Optimization.

[20]  A. Itai,et al.  QUEUES, STACKS AND GRAPHS , 1971 .

[21]  Marc Demange,et al.  9. The Online Track Assignment Problem , 2010 .

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

[23]  Willi Jäger,et al.  Mathematics - Key Technology for the Future Joint Projects between Universities and Industry , 2003 .

[24]  Uwe T. Zimmermann,et al.  Real-time dispatch of trams in storage yards , 2000, Ann. Oper. Res..

[25]  Miklós Bóna,et al.  A Survey of Stack-Sorting Disciplines , 2003, Electron. J. Comb..

[26]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

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