Solving a real-world train-unit assignment problem

Mathematical Programming

Volumn 124, Issue 1-2, 2010, Pages 207-231

  Cacchiani, Valentina ^a   Caprara, Alberto ^a   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Column generation; Knapsack polytope; Real world application; Train unit assignment

Indexed keywords

ASSIGNMENT PROBLEMS; COLUMN GENERATION; COMPUTATIONAL RESULTS; CONVEX HULL; HEURISTIC APPROACH; ILP FORMULATION; PASSENGER SEATS; POLYTOPES; REAL-WORLD; REAL-WORLD APPLICATION; REGIONAL AREAS; RUNNING TRAIN;

LOCOMOTIVES; RAILROAD CARS;

TRAVELING SALESMAN PROBLEM;

EID: 77955173320     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0361-y     Document Type: Article

References (26)

1. E.W.J. Abbink B.W.V. van den Berg L.G. Kroon M. Salomon 2004 Allocation of railway rolling stock for passenger trains Transp. Sci. 38 33 41 10.1287/trsc.1030.0044
2. A. Alfieri R. Groot L.G. Kroon A. Schrijver 2006 Efficient circulation of railway rolling stock Transp. Sci. 40 378 391 10.1287/trsc.1060.0155 (Pubitemid 44147358)
3. N. Ben-Khedher J. Kintanar C. Queille W. Stripling 1998 Schedule optimization at SNCF: from conception to day of departure Interfaces 28 6 23 10.1287/inte.28.1.6
4. F. Bonomo G. Durán J. Marenco 2006 Exploring the complexity boundary between coloring and list-coloring Electron. Notes Discret. Math. 25 41 47 10.1016/j.endm.2006.06.064 (Pubitemid 44137035)
5. J. Brucker J.L. Hurink T. Rolfes 2003 Routing of railway carriages J. Glob. Optim. 27 313 332 1033.90034 10.1023/A:1024843208074 2013678
6. M.R. Bussieck T. Winter U.T. Zimmermann 1997 Discrete optimization in public rail transport Math. Program. 79 415 444 1464777
7. Cacchiani, V., Caprara, A., Maróti, G., Toth, P.: On Integer Polytopes with Few Nonzero Vertices, Research Report OR/09/1 DEIS. http://www.or.deis.unibo.it/alberto/smallsupp.pdf (2009)
8. Caprara A., Kroon L., Monaci M., Peeters M., Toth P.: Passenger Railway Optimization. In: Barnhart, C., Laporte, G. (eds) Handbooks in OR & MS, vol. 14, Elsevier, Amsterdam (2006)
9. D. Carpaneto M. Dell'Amico M. Fischetti P. Toth 1989 A branch and bound algorithm for the multiple-depot vehicle scheduling problem Networks 19 531 548 0672.90073 10.1002/net.3230190505 1006191
10. Cook W.J., Cunningham W.H., Pulleyblank W.R., Schrijver A.: Combinatorial Optimization. Wiley, New York (1998)
11. J.-F. Cordeau P. Toth D. Vigo 1998 A survey of optimization models for train routing and scheduling Transp. Sci. 32 380 404 0987.90507 10.1287/trsc.32.4.380
12. J.-F. Cordeau F. Soumis J. Desrosiers 2000 A Benders decomposition approach for the locomotive and car assignment problem Transp. Sci. 34 133 149 1004.90045 10.1287/trsc.34.2.133.12308
13. J.-F. Cordeau F. Soumis J. Desrosiers 2001 Simultaneous assignment of locomotives and cars to passenger trains Oper. Res. 49 531 548 1163.90597 10.1287/opre.49.4.531.11226 1852359
14. J.-F. Cordeau G. Desaulniers N. Lingaya F. Soumis J. Desrosiers 2002 Simultaneous locomotive and car assignment at VIA rail Canada Transp. Res. 35 767 787 10.1016/S0191-2615(00)00022-9
15. Desrosiers J., Dumas Y., Solomon M.M., Soumis F. et al.: Time Constrained Routing and Scheduling. In: Ball, M.O. (eds) Handbooks in OR & MS, vol. 8, pp. 35-139. Elsevier, Amsterdam (1995)
16. P.-J. Fioole L.G. Kroon G. Maróti A. Schrijver 2006 A rolling stock circulation model for combining and splitting of passenger trains Eur. J. Oper. Res. 174 1281 1297 1102.90312 10.1016/j.ejor.2005.03.032 (Pubitemid 44109937)
17. Garey M.R., Johnson D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, New York (1979)
18. Grötschel M., Lovász L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)
19. A. Hadjar O. Marcotte F. Soumis 2006 A branch-and-cut algorithm for the multiple depot vehicle scheduling problem Oper. Res. 54 130 149 1167.90509 10.1287/opre.1050.0240
20. D. Huisman L.G. Kroon R.M. Lentink M.J.C.M. Vromans 2005 Operations research in passenger railway transportation Stat. Neerland. 59 467 497 1149.90435 10.1111/j.1467-9574.2005.00303.x 2252465 (Pubitemid 41498818)
21. N. Lingaya J.-F. Cordeau G. Desaulniers J. Desrosiers F. Soumis 2002 Operational Car Assignment at VIA Rail Canada Transp. Res. 36 755 778 10.1016/S0191-2615(01)00027-3 (Pubitemid 34923541)
22. Martello S., Toth P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
23. M. Peeters L.G. Kroon 2008 Circulation of railway rolling stock: a branch-and-price approach Comput. Oper. Res. 35 538 556 1141.90009 10.1016/j.cor.2006.03.019 (Pubitemid 47039276)
24. S. Rouillon G. Desaulniers F. Soumis 2006 An extended branch-and-bound method for locomotive assignment Transp. Res. 40 404 423 10.1016/j.trb.2005.05. 005 (Pubitemid 43257275)
25. A. Schrijver 1993 Minimum circulation of railway stock CWI Q. 6 205 217 0800.90397
26. K. Ziarati F. Soumis J. Desrosiers M.M. Solomon 1999 A branch-first, cut-second approach for locomotive assignment Manag. Sci. 45 1156 1168 10.1287/mnsc.45.8.1156