Shunting of Passenger Train Units: An Integrated Approach

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

References

  • 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(1):137–148Google Scholar
  • Cordeau J. F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32(4):380–404LinkGoogle Scholar
  • Dahlhaus E., Horak P., Miller M., Ryan J. F. The train marshalling problem. Discrete Appl. Math. (2000) 103(1–3):41–54CrossrefGoogle Scholar
  • Di Stefano G., Kǒci M. L. A graph theoretical approach to the shunting problem. Electronic Notes Theoret. Comput. Sci. (2003) 92(1):16–33Google Scholar
  • Freling R., Lentink R. M., Kroon L. G., Huisman D. Shunting of passenger train units in a railway station. Transportation Sci. (2005) 39(2):261–272LinkGoogle Scholar
  • Gallo G., Di Miele F. Dispatching buses in parking depots. Transportation Sci. (2001) 35(3):322–330LinkGoogle Scholar
  • Haijema R., Duin C. W., Van Dijk N. M., van Wezel W., Jorna R., Meystel A. Train shunting: A practical heuristic inspired by dynamic programming. Planning in Intelligent Systems (2006) (John Wiley & Sons, New York) 437–477CrossrefGoogle Scholar
  • Hamdouni M., Desaulniers G., Soumis F. Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches. Comput. Oper. Res. (2007) 34(11):3362–3379CrossrefGoogle Scholar
  • Hamdouni M., Desaulniers G., Marcotte O., Soumis F., van Putten M. Dispatching buses in a depot using block patterns. Transportation Sci. (2006) 40(3):364–377LinkGoogle Scholar
  • He S., Song R., Chaudhry S. S. Fuzzy dispatching model and genetic algorithms for railyards operations. Eur. J. Oper. Res. (2000) 124(2):307–331CrossrefGoogle Scholar
  • He S., Song R., Chaudhry S. S. An integrated dispatching model for railyard operations. Comput. Oper. Res. (2003) 30(7):939–966CrossrefGoogle Scholar
  • Huisman D., Kroon L. G., Lentink R. M., Vromans M. J. C. M. Operations research in passenger railway transportation. Statistica Neerlandica (2005) 59(4):467–498CrossrefGoogle Scholar
  • Lentink R. M. Algorithmic decision support of shunt planning. (2006) . Ph.D. thesis, Erasmus Research Institute of Management, Erasmus University, Rotterdam, The NetherlandsGoogle Scholar
  • Lentink R. M., Fioole P. J., Kroon L. G., van 't Woudt C., van Wezel W., Jorna R., Meystel A. Applying operations research techniques to planning of train shunting. Planning in Intelligent Systems (2006) (John Wiley & Sons, New York) 415–436CrossrefGoogle Scholar
  • Lübbecke M. E., Zimmermann U. T. Shunting minimal rail car allocation. Computational Optim. Appl. (2005) 31(3):295–308CrossrefGoogle Scholar
  • Tomii N., Zhou L. J., Allan J., Hill R., Brebbia C. A., 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., Imam I., Kodratoff Y., El-Dessouki A., Ali M. An algorithm for station shunting scheduling problems combining probabilistic local search and PERT. Multiple Approaches to Intelligent Systems: 12th Internat. Conf. Indust. Engrg. Appl. Artificial Intelligence Expert Systems, Lecture Notes in Artificial Intelligence (1999) 1611(Springer-Verlag, Berlin) 788–797CrossrefGoogle Scholar
  • Winter T. Online and real-time dispatching problems. (1999) . Ph.D. thesis, Technical University Braunschweig, Braunschweig, GermanyGoogle Scholar
  • Winter T., Zimmermann U. T. Real-time dispatch of trams in storage yards. Ann. Oper. Res. (2000) 96:287–315CrossrefGoogle Scholar
  • Zwaneveld P. J. Railway planning—Routing of trains and allocation of passenger lines. (1997) . Ph.D thesis, Erasmus University Rotterdam, Rotterdam, The NetherlandsGoogle 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.