Efficient circulation of railway rolling stock

Transportation Science

Volumn 40, Issue 3, 2006, Pages 378-391

  Alfieri, Arianna ^a   Groot, Rutger ^b   Kroon, Leo ^c,d   Schrijver, Alexander ^e  

^a POLITECNICO DI TORINO   (Italy)

^b ORTEC The Netherlands   (Netherlands)

^c NS Reizigers   (Netherlands)

^d ERASMUS UNIVERSITY   (Netherlands)

^e CWI   (Netherlands)

Author keywords

Circulation of rolling stock; Multicommodity flow model; Railway transportation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; MATHEMATICAL MODELS; NUMBER THEORY; NUMERICAL ANALYSIS;

CIRCULATION OF ROLLING STOCK; MULTICOMMODITY FLOW MODEL; RAILWAY TRANSPORTATION;

RAILROAD TRANSPORTATION;

EID: 33746619300     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1060.0155     Document Type: Article

References (19)

1. Abbink, E. J. W., B. W. V. van den Berg, L. G. Kroon, M. Salomon. 2004. Allocation of train units to passenger trains. Transportation Sci. 38(1) 33-41.
2. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flow - Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
3. Arkin, E. M., E. L. Silverberg. 1987. Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18 1-8.
4. Barnhart, C., A. Hane, P. H. Vance. 1998. Using branch-and-price to solve origin-destination integer multi-commodity flow problems. Oper. Res. 32 208-220.
5. Ben-Khedher, N., J. Kintanar, C. Queille, W. Stripling. 1998. Schedule optimization at SNCF: From conception to day of departure. Interfaces 28 6-23.
6. Brucker, P., J. Hurink, T. Rolfes. 2003. Routing of railway carriages: A case study. J. Global Optimiz. 27 313-332.
7. Cordeau, J. F., F. Soumis, J. Desrosiers. 2000. A Benders decomposition approach for the locomotive and car assignment problem. Transportation Sci. 34 133-149.
8. Cordeau, J. F., F. Soumis, J. Desrosiers. 2001. Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49 531-548.
9. Fioole, P.-J., L. G. Kroon, G. Maróti, A. Schrijver. 2005. Rolling stock circulation of passenger train units: Splitting and combining of passenger trains. CWI Report PNA-E0420, ISSN 1386-3711. CWI, Amsterdam, The Netherlands. Eur. J. Oper. Res. Forthcoming.
10. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide into the Theory of NP-Completeness. Freeman, San Francisco, CA.
11. Groot, R. 1996. Minimum circulation of railway stock: An integer programming algorithm. Master's thesis, University of Amsterdam, The Netherlands.
12. Kroon, L. G., H. E. Romeijn, P. J. Zwaneveld. 1999. Routing trains through railway stations: Complexity issues. Eur. J. Oper. Res. 98 485-498.
13. 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.
14. Maróti, G., L. G. Kroon. 2005. Maintenance routing of passenger train units: The transition model. Transportation Sci. 39(4) 518-525.
15. McBride, R. D. 1998. Advances in solving the multi-commodity-flow problem. Interfaces 28 32-41.
16. NS homepage: www.ns.nl.
17. Peeters, M., L. G. Kroon. 2006. Circulation of railway rolling stock: A branch-and-price approach. Comput. Oper. Res. Forthcoming.
18. Schrijver, A. 1993. Minimum circulation of railway stock. CWI Quart. 6 205-217.
19. van Monfort, J. 1997. Optimizing Railway Carriage Circulation with Integer Linear Programming. Master's thesis, University of Amsterdam, The Netherlands.