Circulation of railway rolling stock: a branch-and-price approach

Computers and Operations Research

Volumn 35, Issue 2, 2008, Pages 538-556

  Peeters, Marc ^a   Kroon, Leo ^b,c  

^a Electrabel   (Belgium)

^b NS Reizigers   (Netherlands)

^c ERASMUS UNIVERSITY   (Netherlands)

Author keywords

Applications; Integer programming; Scheduling; Transportation; Vehicles: Circulation of railway rolling stock

Indexed keywords

RAILWAY ROLLING STOCKS; TRAIN COMPOSITIONS;

ALGORITHMS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PASSENGER CARS; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING; TRANSPORTATION;

RAILROAD ROLLING STOCK;

EID: 34447274553     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.03.019     Document Type: Article

References (22)

1. Maróti G., and Kroon L.G. Maintenance routing for train units: the transition model. Transportation Science 39 4 (2005) 518-525
2. Desrosiers J., Soumis F., and Desrochers M. Routing with time windows by column generation. Networks 14 (1984) 545-565
3. Desrosiers J., and Soumis F. A column generation approach to the urban transit crew scheduling problem. Transportation Science 23 (1989) 1-12
4. Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research 45 (1997) 831-841
5. Vanderbeck F., and Wolsey L.A. An exact algorithm for IP column generation. Operations Research Letters 19 (1996) 151-159
6. Barnhart C., Johnson E.L., Nemhauser L.E., Savelsbergh M.W.P., and Vance P.H. Branch-and-price: column generation for solving huge integer programs. Operations Research 43 (1998) 316-329
7. Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research 48 (2000) 111-128
8. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: theory, algorithms, and applications (1993), Prentice-Hall, Englewood Cliffs, NJ
9. Barnhart C., Hane C.A., and Vance P.H. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48 (2000) 318-326
10. Holmberg K., and Yuan D. A multicommodity network flow problem with side constraints on paths solved by column generation. Informs Journal on Computing 15 (2003) 42-57
11. Schrijver A. Minimum circulation of railway stock. CWI Quarterly 6 (1993) 205-217
12. Ben-Khedher N., Kintanar J., Queille C., and Stripling W. Schedule optimization at SNCF: from conception to day of departure. Interfaces 28 (1998) 6-23
13. Alfieri A., Groot R., Kroon L.G., and Schrijver A. Efficient circulation of railway rolling stock. Transportation Science 40 (2006) 378-391
14. Fioole P.-J., Kroon L.G., Maróti G., and Schrijver A. A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operational Research 174 2 (2006) 1281-1297
15. Brucker J, Hurink T, Rolfes T. Routing of railway carriages: a case study. Osnabrücker Geschriften zur Mathematik Reihe P, Heft 205; 1998.
16. Cordeau J.F., Soumis F., and Desrosiers J. A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science 34 (2000) 133-149
17. Cordeau J.F., Soumis F., and Desrosiers J. Simultaneous assignment of locomotives and cars to passenger trains. Operations Research 49 (2001) 531-548
18. Lingaya N., Cordeau J.F., Desaulniers G., Desrosiers J., and Soumis F. Operational car assignment at VIA rail Canada. Transportation Research B 36 (2002) 755-778
19. Abbink E.J.W., van den Berg B.W.V., Kroon L.G., and Salomon M. Allocation of railway rolling stock for passenger trains. Transportation Science 38 (2004) 33-41
20. Dantzig G.B., and Wolfe P. Decomposition principle for linear programming. Operations Research 8 (1960) 101-111
21. Wolsey L.A. Integer programming. Wiley Series in Discrete Mathematics and Optimization (1998), Wiley, Chichester
22. Nemhauser G.L., and Wolsey L.A. Integer and combinatorial optimization. Wiley Series in Discrete Mathematics and Optimization (1988), Wiley, Chichester