Track assignment

Journal of Discrete Algorithms

Volumn 5, Issue 2 SPEC. ISS., 2007, Pages 250-261

  Cornelsen, Sabine ^a   Di Stefano, Gabriele ^b  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Circular arc containment graphs; Graph algorithms; Graph coloring; Railway optimization

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; RAILROAD TRACKS; RAILS; TABLE LOOKUP;

CIRCULAR ARC CONTAINMENT GRAPHS; GRAPH ALGORITHMS; GRAPH COLORING; RAILWAY OPTIMIZATION;

RAILROAD STATIONS;

EID: 34247111201     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.05.001     Document Type: Article

References (21)

1. Blasum U., Bussieck M.R., Hochstättler W., Moll C., Scheel H.-H., and Winter T. Scheduling trams in the morning. Mathematical Methods of Operations Research 49 1 (1999) 137-148
2. Chvátal V. Perfectly ordered graphs. Topics on Perfect Graphs. Annals of Discrete Mathematics vol. 21 (1984), North-Holland 63-65
3. Cornelsen S., and Di Stefano G. Platform assignment. In: Schöbel A., and Wagner F.H. (Eds). Proceedings of the 4th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2004). Lecture Notes in Computer Science (2004), Springer
4. Dahlhaus E., Horak P., Miller M., and Ryan J.F. The train marshalling problem. Discrete Applied Mathematics 103 1-3 (2000) 41-54
5. G. Di Stefano, M.L. Koci, A graph theoretical approach to the shunting problem, in: B. Gerards (Ed.), Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003), Electronic Notes in Theoretical Computer Science, vol. 92, 2004
6. Freling R., Lentink R.M., Kroon L.G., and Huisman D. Shunting of passenger train units in a railway station. Technical Report EI2002-26, Econometric Institute, Erasmus University Rotterdam (2002). http://www.eur.nl/WebDOC/doc/econometrie/feweco20020917130601.pdf Transportation Science, submitted for publication
7. Gallo G., and Di Miele F. Dispatching buses in parking depots. Transportation Science 35 3 (2001) 322-330
8. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. Computer Science and Applied Mathematics (1980), Academic Press
9. Hamdouni M., Desaulniers G., Marcotte O., Soumis F., and van Putten M. Dispatching buses in a depot using block patterns. Technical Report G-2004-51, Les Cahiers du GERAD, 2005. http://www.gerad.ca
10. Hamdouni M., Desaulniers G., and Soumis F. Parking buses in a depot using block patterns: A benders decomposition approach for minimizing type mismatches. Technical Report G-2005-70, Les Cahiers du GERAD, 2005. http://www.gerad.ca
11. He S., Song R., and Chaudhry S.S. Fuzzy dispatching model and genetic algorithms for railyards operations. European Journal of Operational Research 124 2 (2000) 307-331
12. Jansen K. The mutual exclusion scheduling problem for permutation and comparability graphs. Information and Computation 180 (2003) 71-81
13. Liebchen C. Fahrplanoptimierung im Personenverkehr - muss es immer ITF sein?. Eisenbahntechnische Rundschau 54 H. 11 (2005) 689-702
14. Lou R.D., and Sarrafzadeh M. Circular permutation graph family with applications. Discrete Applied Mathematics 40 (1992) 433-457
15. Nikolopoulos S.D., and Papadopoulos C. On the performance of the first-fit coloring algorithm on permutation graphs. Information Processing Letters 75 (2000) 265-273
16. Nirkhe M.V. Efficient algorithms for circular-arc containment graphs. Master's thesis, University of Maryland, 1987. http://techreports.isr.umd.edu/report/1987/MS_87-11.pdf
17. Pnueli A., Lempel A., and Even S. Transitive orientation of graphs and identification of permutation graphs. Canadian Journal of Mathematics 23 (1971) 160-175
18. A. Rossi, Il problema dell'ordinamento dei treni in un deposito: modellazione e soluzione algoritmica, Master's thesis, Università dell'Aquila, 2003
19. Unger W. On the k-colouring of circle-graphs. In: Cori R., and Wirsing M. (Eds). Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science (STACS '88). Lecture Notes in Computer Science vol. 294 (1988), Springer 61-72
20. Winter T., and Zimmermann U.T. Real-time dispatch of trams in storage yards. Annals of Operations Research 96 (2000) 287-315
21. Zwaneveld P.J., Dauzère-Pérès S., van Hoesel S.P.M., Kroon L.G., Romeijn H.E., Salomon M., and Ambergen H.W. Routing trains through railway stations: model formulation and algorithms. Transportation Science 30 (1996) 181-194