Scheduling Locomotives and Car Transfers in Freight Transport

References

• Ahuja R. K., Jha K. C., Liu J. Solving real-life railroad blocking problems. Interfaces (2007) 37(5):404–419Link, Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Ahuja R. K., Liu J., Orlin J. B., Sharma D., Shughart L. Solving real-life locomotive scheduling problems. Transportation Sci. (2005) 39(4):503–517Link, Google Scholar
• Booler J. The solution of a railway locomotive scheduling problem. J. Oper. Res. Soc. (1980) 31(10):943–948Crossref, Google Scholar
• Bussieck M., Winter T., Zimmermann U. Discrete optimization in public rail transport. Math. Programming (1997) 79(3):415–444Crossref, Google Scholar
• Caprara A., Fischetti M., Toth P., Vigo D. Algorithms for railway crew planning. Math. Programming (1997) 79(1):125–141Crossref, Google Scholar
• Cordeau J., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32:988–1005Link, Google Scholar
• Daduna J., Völker M. Fahrzeugumlaufbildung im ÖPNV mit unscharfen abfahrtszeiten. Der Nahverkehr (1997) 11:39–43Google Scholar
• Dell'Amico M., Maffioli F., Martello S. Annotated bibliographies in combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization (1997) (John Wiley & Sons, Chichester, UK) Google Scholar
• Deutsche Bahn. Geschäftsbericht des Konzerns. (2005) . Deutsche Bahn AG, Berlin. http://www.db.deGoogle Scholar
• Forbes M., Holt J., Watts A. Exact solution of locomotive scheduling problems. J. Oper. Res. Soc. (1991) 42(10):825–831Crossref, Google Scholar
• Fügenschuh A., Blesa Aguilera M. J., Blum C., Roli A., Sampels M. Parametrized greedy heuristics in theory and practice. Hybrid Metaheuristics, Second International Workshop, HM 2005 (2005a) 3636August 29–30Barcelona, Spain(Springer, Berlin) 21–31Lecture Notes in Computer ScienceCrossref, Google Scholar
• Fügenschuh A.The Integrated Optimization of School Starting Times and Public Transport (2005b) (Logos Verlag, Berlin) Google Scholar
• Fügenschuh A., Martin A., Aardal K., Nemhauser G., Weismantel R. Computational integer programming and cutting planes. Handbooks in Operations Research and Management Science (2005) 12(Elsevier, Amsterdam) 69–122Google Scholar
• ILOG Ltd. ILOG Cplex 10 Solver Suite. (2006) . Technical report, ILOG Cplex Division, Incline Village, NVGoogle Scholar
• Liebchen C., Möhring R. The modeling power of the periodic event scheduling problem: Railway timetables—and beyond. (2004) . Technical Report 2004/20, Technische Universität Berlin, BerlinGoogle Scholar
• Löbel A.Optimal Vehicle Scheduling in Public Transit (1997) (Shaker Verlag, Aachen, Germany) Google Scholar
• Nemhauser G., Wolsey L.Integer and Combinatorial Optimization (1999) (Wiley Interscience, New York) Google Scholar
• Powell W., Bouzaiene-Ayari B. Approximate dynamic programming for locomotive optimization. (2006) . Technical report, Princeton University, Princeton, NJGoogle Scholar
• Powell W., Bouzaiene-Ayari B. Approximate dynamic programming for rail operations. (2007) . Technical report, Princeton University, Princeton, NJGoogle Scholar
• Railion Deutschland Geschäftsbericht Railion Deutschland AG, Mainz, Germany. (2005) . http://www.db.deGoogle Scholar
• Rothberg E., Bixby R., Fenelon M., Gu Z., Wunderling R. Solving multi-objective models. Oberwolfach Reports (2004) 1(2):963–1036Report 19Google Scholar
• Smith S., Sheffi Y. Locomotive scheduling under uncertain demand. Transportation Res. Record (1989) 1251:45–53Google Scholar
• Ziarati K., Chizari H., Nezhad A. Locomotive optimization using artificial intelligence approach. Iranian J. Sci. Tech., Trans. B, Engrg. (2005) 29:93–105Google Scholar
• Ziarati K., Soumis F., Desrosiers J., Solomon M. A branch-first, cut-second approach for locomotive assignment. Management Sci. (1999) 45:1156–1168Link, Google Scholar