Shunting of passenger train units in a railway station

Transportation Science

Volumn 39, Issue 2, 2005, Pages 261-272

  Freling, Richard ^a   Lentink, Ramon M ^a   Kroon, Leo G ^a,b   Huisman, Dennis ^a,b  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b NS Reizigers   (Netherlands)

Author keywords

Column generation; Passenger railway transport; Planning support; Shunting

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; RAILROAD ROLLING STOCK; RAILROAD STATIONS; RAILROAD TRANSPORTATION;

COLUMN GENERATION; PASSENGER RAILWAY TRANSPORT; PLANNING SUPPORT; SHUNTING;

OPERATIONS RESEARCH;

EID: 19944407938     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0076     Document Type: Article

References (16)

1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46 316-329.
2. Blasum, U., M. R. Bussieck, W. Hochstättler, C. Moll, H.-H. Scheel, T. Winter. 2000. Scheduling trams in the morning. Math. Methods Oper. Res. 49 137-148.
3. Cordeau, J.-F. P. Toth, D. Vigo. 1998. A survey of optimization models for train routing and scheduling. Transportation Sci. 32 380-404.
4. Dahlhaus, E., P. Horak, M. Miller, J. F. Ryan. 2000. The train marshalling problem. Discrete Appl. Math. 103 41-54.
5. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. North-Holland, Amsterdam, the Netherlands, 35-139.
6. Fodor Birtalan, I. 2003. Matching arrivals to departures in the train unit shunting problem. Master's thesis, Erasmus University, Rotterdam, the Netherlands.
7. Gallo, G., F. Di Miele. 2001. Dispatching buses in parking depots. Transportation Sci. 35 322-330.
8. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.
9. He, S., R. Song, S. S. Chaudhry. 2000. Fuzzy dispatching model and genetic algorithms for railyards operations. Eur. J. Oper. Res. 124 307-331.
10. Knuth, D. E. 1968. Fundamental Algorithms. Addison Wesley, Reading, MA.
11. Kroon, L. G., H. E. Romeijn, P. J. Zwaneveld. 1997. Routing trains through railway stations: Complexity issues. Eur. J. Oper. Res. 98 485-498.
12. Lingaya, N., J.-F. Cordeau, G. Desaulniers, J. Desrosiers, F. Soumis. 2002. Operational car assignment at VIA Rail Canada. Transportation Res. Part B 36 755-778.
13. Tomii, N., L. J. Zhou. 2000. Depot shunting scheduling using combined genetic algorithm and PERT. J. Allan, R. Hill, C. Brebbia, G. Sciutto, S. Sone, eds. Proc. COMPRAIL 2000. Wit Press, Southampton, UK, 437-446.
14. Tomii, N., L. J. Zhou, N. Fukumara. 1999. Shunting scheduling problem at railway stations. Lecture Notes Artificial Intelligence 1611 790-797.
15. Winter, T. 1999. Online and real-time dispatching problems. Ph.D. thesis, Technical University, Braunschweig, Germany
16. Winter, T., U. T. Zimmermann. 2000. Real-time dispatch of trams in storage yards. Ann. Oper. Res. 96 287-315.