Optimizing the Cargo Express Service of Swiss Federal Railways

References

• Achterberg T. Constraint integer programming. (2007) . Ph.D. thesis, Technische Universität Berlin, Berlin. http://opus.kobv.de/tuberlin/volltexte/2007/1611/Google Scholar
• Ahuja R. K., Jha K. C., Liu J. Solving real-life railroad blocking problems. Interfaces (2007) 47(5):404–419Link, Google Scholar
• Assad A. A. Models for rail transportation. Transportation Res. Part A: General (1980) 14A:205–220Crossref, Google Scholar
• Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M.Complexity and Approximation (1998) (Springer-Verlag, Berlin) Google Scholar
• Beasley J., Christofides N. An algorithm for the resource constrained shortest path problem. Networks (1989) 19:379–394Crossref, Google Scholar
• Blasum U., Hochstattler W. Application of the branch and cut method to the vehicle routing problem. (2000) . Technical Report zpr2000-386, Zentrum für angewandte Informatik, Köln, GermanyGoogle Scholar
• Boland N., Detheridge J., Dumitrescu I. Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. (2006) 34(1):58–68Crossref, Google Scholar
• Campetella M., Lulli G., Pietropaoli U., Ricciardi N., Jacob R., Müller-Hannemann M. Freight service design for the Italian railways company. ATMOS 2006—6th Workshop on Algorithmic Methods and Models for Optim. Railways (2006) . Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. Retrieved January 1, 2006, http://drops.dagstuhl.de/opus/volltexte/2006/685Google Scholar
• Ceselli A., Righini G. A branch and price algorithm for the capacitated p-median problem. Networks (2005) 45(3):125–142Crossref, Google Scholar
• Ceselli A., Gatto M., Lübbecke M. E., Nunkesser M., Schilling H. Implementation of the edge-based classical vehicle routing model and of the TSSP problem for SBB Cargo Express in OPL. (2006) . OPL files, http://www.inf.ethz.ch/personal/mnunkess/SBB-Cargo/Google Scholar
• Christofides N., Mingozzi A., Toth P. Exact algorithms for vehicle routing. Math. Programming (1981) 20:255–282Crossref, Google Scholar
• Clarke G., Wright J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. (1964) 12(4):568–581Link, Google Scholar
• Cordeau J.-F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32(4):380–404Link, Google Scholar
• Crainic T., Laporte G. Planning models for freight transportation. Eur. J. Oper. Res. (1997) 97:409–438Crossref, Google Scholar
• Crainic T., Ferland J.-A., Rousseau J.-M. A tactical planning model for rail freight transportation. Transportation Sci. (1984) 18(2):165–184Link, Google Scholar
• Danna E., Pape C. L. Branch-and-price heuristics: A case study on the vehicle routing problem with time windows. Column Generation (2005) (Springer-Verlag, New York) 99–129Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Solomon M. M., Ribeiro C. C., Hansen P. Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. Essays and Surveys in Metaheuristics (2001) (Kluwer, Boston) 309–324Google Scholar
• Desaulniers G., Desrosiers J., Solomon M. M.Column Generation (2005) (Springer-Verlag, New York) Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Lasry A., Solomon M. M. Crew pairing for a regional carrier. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems (1999) (Springer-Verlag, Berlin) 19–41Crossref, Google Scholar
• Feillet D., Dejax P., Gendreau M., Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks (2004) 44(3):216–229Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability (1979) (W. H. Freeman and Company, San Francisco) Google Scholar
• Gatto M., Jacob R., Nunkesser M. Optimization of a railway hub-and-spoke system: Routing and shunting. (2005) . Technical Report 477, ETH Zürich, ZürichGoogle Scholar
• Gorman M. F. An application of genetic and tabu searches to the freight railroad operating plan problem. Ann. Oper. Res. (1998) 78:51–69Crossref, Google Scholar
• Hall R. On the road to recovery. OR/MS Today (2004) June). http://www.lionhrtpub.com/orms/orms-6-04/frsurvey.htmlGoogle Scholar
• Hall A., Hippler S., Skutella M. Multicommodity flows over time: Efficient algorithms and complexity. Proc. 30th Internat. Colloquium on Automata, Languages and Programming (ICALP'03). Lecture Notes in Computer Science (2003) 2719(Springer-Verlag, Berlin) 397–409Crossref, Google Scholar
• Hentenryck P. V.The OPL Optimization Programming Language (1999) (MIT Press, Cambridge, MA) Google Scholar
• Irnich S., Desaulniers G. Shortest path problems with resource constraints. Column Generation (2005) (Springer-Verlag, New York) 33–65Crossref, Google Scholar
• Keaton M. H. Designing railroad operating plans: A dual adjustment mehod for implementing Lagrangian relaxation. Transportation Sci. (1992) 26(4):263–279Link, Google Scholar
• Kwon O. K., Marthland C. D., Sussman J. M. Routing and scheduling temporal and heterogeneous freight car traffic on rail networks. Transportation Res. Part E: Logist. Transportation Rev. (1998) 34(2):101–115Crossref, Google Scholar
• Laporte G., Desrochers M., Nobert Y. Two exact algorithms for the distance-constrained vehicle routing problem. Networks (1984) 14(1):161–172Crossref, Google Scholar
• Laporte G., Nobert Y., Desrochers M. Optimal routing under capacity and distance restrictions. Oper. Res. (1985) 33(5):1050–1073Link, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B.The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (John Wiley & Sons, Chichester, UK) Google Scholar
• Lübbecke M. Dual variable based fathoming in dynamic programs for column generation. Eur. J. Oper. Res. (2005) 162(1):122–125Crossref, Google Scholar
• Makedon F. S., Papadimitriou C. H., Sudborough I. H. Topological bandwidth. SIAM J. Algebraic Discrete Methods (1985) 6(3):418–444Crossref, Google Scholar
• Monien B., Sudborough I. H. Min cut is NP-complete for edge weighted trees. Theoret. Comput. Sci. (1988) 58(1–3):209–229Crossref, Google Scholar
• Naddef D., Rinaldi G. Branch-and-cut algorithms for the capacitated VRP. The Vehicle Routing Problem (2002) (SIAM, Philadelphia) 53–84SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Pisinger D. A minimal algorithm for the 0–1 knapsack problem. Oper. Res. (1997) 45:758–767Link, Google Scholar
• Ralphs T. Branch cut and price references. (2006) . Retrieved January 1, 2006, http://branchandcut.org/reference.htm#implementationsGoogle Scholar
• Ralphs T. K., Ladányi L. SYMPHONY: A parallel framework for branch and cut. (1999) . White paper, Rice University, HoustonGoogle Scholar
• Ralphs T., Kopman L., Pulleyblank W. R., Trotter L. E. On the capacitated vehicle routing problem. Math. Programming (2003) 94(2–3):343–359Crossref, Google Scholar
• Rousseau L. M., Gendreau M., Feillet D. Interior point stabilization for column generation. Oper. Res. Lett. (2007) 35:660–668Crossref, Google Scholar
• SBB Cargo Express. (2006) . Retrieved January 1, 2006, http://www./sbbcargo.com/en/index/ang_produkte/ang_produkte_express.htmGoogle Scholar
• Toth P., Vigo D. An overview of vehicle routing problems. The Vehicle Routing Problem (2002) (SIAM, Philadelphia) 1–26SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Toth P., Vigo D. Branch-and-bound algorithms for the capacitated VRP. The Vehicle Routing Problem (2002) (SIAM, Philadelphia) 29–51SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002) (SIAM, Philadelphia) . SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Wolsey L. A.Integer Programming (1998) (John Wiley & Sons, New York) Google Scholar