Multistage methods for freight train classification

OpenAccess Series in Informatics

Volumn 7, Issue , 2007, Pages 158-174

  Jacob, Riko ^a   Márton, Peter ^b   Maue, Jens ^c   Nunkesser, Marc ^c  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF ILINA   (Slovakia)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION METHODS; ENCODING SCHEMES; FREIGHT TRAINS; MULTI-STAGE METHODS; OPTIMAL ALGORITHM; OPTIMALITY CONDITIONS; REAL-WORLD; THEORETICAL POINTS;

ALGORITHMS; ENCODING (SYMBOLS);

OPTIMIZATION;

EID: 84882960199     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Flandorffer, H.: Vereinfachte Güterzugbildung. ETR RT 13 (1953) 114-118
2. Baumann, O.: Die Planung der Simultanformation von Nahgüterzü gen für den Rangierbahnh of Zürich-Limmattal. ETR RT 19 (1959) 25-35
3. Krell, K.: Grundgedanken des Simultanverfahrens. ETR RT 22 (1962) 15-23
4. Krell, K.: Ein Beitrag zur gemeinsamen Nutzung von Nahgüterzü gen. ETR RT 23 (1963) 16-25
5. Siddiqee, M.W.: Investigation of sorting and train formation schemes for a railroad hump yard. In: Proc. of the 5th Int. Symposium on the Theory of Traffic Flow and Transportation. (1972) 377-387
6. Daganzo, C.F., Dowling, R.G., Hall, R.W.: Railroad classification yard throughput: The case of multistage triangular sorting. Transportation Research, Part A 17(2) (1983) 95-106
7. Daganzo, C.F.: Static blocking at railyards: Sorting implications and track requirements. Transportation Science 20(3) (1986) 189-199
8. Daganzo, C.F.: Dynamic blocking for railyards: Part I. homogeneous traffic. Transportation Research 21B(1) (1987) 1-27
9. Daganzo, C.F.: Dynamic blocking for railyards: Part II. heterogeneous traffic. Transportation Research 21B(1) (1987) 29-40
10. Dahlhaus, E., Horák, P., Miller, M., Ryan, J.F.: The train marshalling problem. Discrete Applied Mathematics 103(1-3) (2000) 41-54
11. Dahlhaus, E., Manne, F., Miller, M., Ryan, J.: Algorithms for combinatorial problems related to train marshalling. In: Proc. of the 11th Australasian Workshop on Combinatorial Algorithms (AWOCA-00). (2000) 7-16
12. Hansmann, R.S., Zimmermann, U.T.: Optimal sorting of rolling stock at hump yards. In: Mathematics - Key Technology for the Future: Joint Projects Between Universities and Industry. Springer (2007)
13. Holliger, H.P.: Rangierbahnh of Limmattal. Personal communication (2007)
14. Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Handbook of Combinatorial Optimization. Volume 4. Kluwer Academic Publishers (1999)
15. Newman, A.: The maximum acyclic subgraph problem and degree-3 graphs. In: Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX. LNCS (2001) 147-158
16. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multi-cuts in directed graphs. In: Proceedings of the 4th International Conference on Integer Programming and Combinatorial Optimization. LNCS (1995) 14-28
17. Cordeau, J.F., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transportation Science 32(4) (1998) 380-404
18. Campetella, M., Lulli, G., Pietropaoli, U., Ricciardi, N.: Freight service design for the italian railways company. In Jacob, R., Müller-Hannemann, M., eds.: ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, IBFI, Schloss Dagstuhl, Germany (2006) .
19. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman (1979)
20. Jacob, R.: On shunting over a hump. Technical Report 576, Institute of Theoretical Computer Science, ETH Zürich (2007)