Shunting of Passenger Train Units in a Railway Station

Published Online:https://doi.org/10.1287/trsc.1030.0076

References

  • Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329LinkGoogle Scholar
  • Blasum U., Bussieck M. R., Hochstättler W., Moll C., Scheel H.-H., Winter T. Scheduling trams in the morning. Math. Methods Oper. Res. (2000) 49:137–148Google Scholar
  • Cordeau J.-F. P. Toth, Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32:380–404LinkGoogle Scholar
  • Dahlhaus E., Horak P., Miller M., Ryan J. F. The train marshalling problem. Discrete Appl. Math. (2000) 103:41–54CrossrefGoogle Scholar
  • Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing (1995) (North-Holland, Amsterdam, the Netherlands) 35–139CrossrefGoogle Scholar
  • Fodor Birtalan I. Matching arrivals to departures in the train unit shunting problem. (2003) . Master’s thesis, Erasmus University, Rotterdam, the NetherlandsGoogle Scholar
  • Gallo G., Di Miele F. Dispatching buses in parking depots. Transportation Sci. (2001) 35:322–330LinkGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, New York) Google Scholar
  • He S., Song R., Chaudhry S. S. Fuzzy dispatching model and genetic algorithms for railyards operations. Eur. J. Oper. Res. (2000) 124:307–331CrossrefGoogle Scholar
  • Knuth D. E.Fundamental Algorithms (1968) (Addison Wesley, Reading, MA) Google Scholar
  • Kroon L. G., Romeijn H. E., Zwaneveld P. J. Routing trains through railway stations: Complexity issues. Eur. J. Oper. Res. (1997) 98:485–498CrossrefGoogle Scholar
  • Lingaya N., Cordeau J.-F., Desaulniers G., Desrosiers J., Soumis F. Operational car assignment at VIA Rail Canada. Transportation Res. Part B (2002) 36:755–778CrossrefGoogle Scholar
  • Tomii N., Zhou L. J., Allan J., Hill R., Brebbia C., Sciutto G., Sone S. Depot shunting scheduling using combined genetic algorithm and PERT. Proc. COMPRAIL 2000 (2000) (Wit Press, Southampton, UK) 437–446Google Scholar
  • Tomii N., Zhou L. J., Fukumara N. Shunting scheduling problem at railway stations. Lecture Notes Artificial Intelligence (1999) 1611:790–797Google Scholar
  • Winter T. Online and real-time dispatching problems. (1999) . Ph.D. thesis, Technical University, Braunschweig, GermanyGoogle Scholar
  • Winter T., Zimmermann U. T. Real-time dispatch of trams in storage yards. Ann. Oper. Res. (2000) 96:287–315CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.