Delay Management Including Capacities of Stations

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

References

  • Arkin EM, Silverberg EB (1987) Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18(1):1–8.CrossrefGoogle Scholar
  • Berger A, Hoffmann R, Lorenz U, Stiller S (2011) Online railway delay management: Hardness, simulation and computation. Simulation 87(7):616–629.CrossrefGoogle Scholar
  • Burdett RL, Kozan E (2010) A disjunctive graph model and framework for constructing new train schedules. Eur. J. Oper. Res. 200(1):85–98.CrossrefGoogle Scholar
  • Caimi G, Chudak F, Fuchsberger M, Laumanns M, Zenklusen R (2011) A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling. Transportation Sci. 45(2):212–227.LinkGoogle Scholar
  • Caprara A, Galli L, Toth P (2011) Solution of the train platforming problem. Transportation Sci. 45(2):246–257.LinkGoogle Scholar
  • Caprara A, Galli L, Stiller S, Toth P (2011) Delay-robust event scheduling. Technical report, DEIS, University of Bologna, Bologna, Italy.Google Scholar
  • Conte C, Schöbel A (2007) Identifying dependencies among delays. 2nd Internat. Seminar Railway Oper. Model. Anal., Rail Hannover 2007, Hannover, Germany.Google Scholar
  • Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2010) A tabu search algorithm for rerouting trains during rail operations. Transportation Res. Part B 44(1):175–192.CrossrefGoogle Scholar
  • Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2012) Bi-objective conflict detection and resolution in railway traffic management. Transportation Res. Part C 20(1):79–94.CrossrefGoogle Scholar
  • Cui Y (2010) Simulation based hybrid model for partially automatic dispatching of railway operation. Doctoral dissertation, University of Stuttgart, Stuttgart, Germany.Google Scholar
  • D’Ariano A, Pacciarelli D, Pranzo M (2007) A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183(2):643–657.CrossrefGoogle Scholar
  • De Giovanni L, Heilporn G, Labbé M (2008) Optimization models for the single delay management problem in public transportation. Eur. J. Oper. Res. 189(3):762–774.CrossrefGoogle Scholar
  • Dollevoet T, Huisman D (2014) Fast heuristics for delay management with passenger rerouting. Public Transport 6(1–2):67–84.CrossrefGoogle Scholar
  • Dollevoet T, Schmidt M, Schöbel A (2011) Delay management including capacities of stations. Caprara A, Kontogiannis S, eds. 11th Workshop Algorithmic Approaches Transportation Modelling, Optimization, Systems, OpenAccess Series in Informatics (OASIcs), Vol. 20 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany), 88–99.Google Scholar
  • Dollevoet T, Corman F, D’Ariano A, Huisman D (2014) An iterative optimization framework for delay management and train scheduling. Flexible Services Manufacturing J. 26(4):490–515.Google Scholar
  • Dollevoet T, Huisman D, Schmidt M, Schöbel A (2012) Delay management with rerouting of passengers. Transportation Sci. 46(1):74–89.LinkGoogle Scholar
  • Ehrgott M (2005) Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems, 2nd ed., Vol. 491 (Springer, Berlin).Google Scholar
  • Gatto M (2007) On the impact of uncertainty on some optimization problems: Combinatorial aspects of delay management and robust online scheduling. Ph.D. thesis, ETH Zürich, Zürich.Google Scholar
  • Gatto M, Jacob R, Peeters L, Schöbel A (2005) The computational complexity of delay management. Kratsch D, ed. Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, Vol. 3787 (Springer, Berlin), 227–238.CrossrefGoogle Scholar
  • Gatto M, Jacob R, Peeters L, Widmayer P (2007) Online delay management on a single train line. Geraets F, Kroon LG, Schöbel A, Wagner D, Zaroliagis C, eds. Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, Vol. 4359 (Springer, Berlin), 306–320.CrossrefGoogle Scholar
  • Ginkel A, Schöbel A (2007) To wait or not to wait? The bicriteria delay management problem in public transportation. Transportation Sci. 41(4):527–538.LinkGoogle Scholar
  • Kliewer N, Suhl L (2011) A note on the online nature of the railway delay management problem. Networks 57(1):28–37.CrossrefGoogle Scholar
  • Kolen AWJ, Kroon LG (1991) On the computational complexity of (maximum) class scheduling. Eur. J. Oper. Res. 54(1):23–38.CrossrefGoogle Scholar
  • Kroon LG, Romeijn HE, Zwaneveld PJ (1997) Routing trains through railway stations: Complexity issues. Eur. J. Oper. Res. 98(3):485–498.CrossrefGoogle Scholar
  • Kroon LG, Sen A, Deng H, Roy A (1996) The optimal cost chromatic partitioning problem for interval graphs and trees. d’Amore F, Franciosa PG, Marchetti-Spaccamela A, eds. Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1197 (Springer Verlag, Berlin), 279–292.Google Scholar
  • Krumke S, Thielen C, Zeck C (2011) Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization. Math. Methods Oper. Res. 74(1):53–75.CrossrefGoogle Scholar
  • Kuckelberg A, Wendler E (2008) Real-time asynchronous conflict solving algorithms for computer aided train dispatching. Eleventh Internat. Conf. Comput. System Design Oper. Railway Other Transit Systems, Toledo, Spain, 555–563.CrossrefGoogle Scholar
  • Lusby R, Larsen J, Ehrgott M, Ryan D (2011) Railway track allocation: Models and methods. OR Spectrum 33(4):843–883.CrossrefGoogle Scholar
  • Lüthi M (2009) Improving the efficiency of heavily used railway networks through integrated real-time rescheduling. Ph.D. thesis, ETH Zürich, Zürich.Google Scholar
  • Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3):498–517.CrossrefGoogle Scholar
  • Schachtebeck M (2010) Delay management in public transportation: Capacities, robustness, and integration. Ph.D. thesis, Universität Göttingen, Göttingen, Germany.Google Scholar
  • Schachtebeck M, Schöbel A (2010) To wait or not to wait—And who goes first? Delay management with priority decisions. Transportation Sci. 44(3):307–321.LinkGoogle Scholar
  • Schöbel A (2001) A model for the delay management problem based on mixed-integer programming. Electronic Notes Theoret. Comput. Sci. 50(1):1–10.CrossrefGoogle Scholar
  • Schöbel A (2006) Optimization in Public Transportation. (Springer, New York).Google Scholar
  • Schöbel A (2007) Integer programming approaches for solving the delay management problem. Geraets F, Kroon LG, Schöbel A, Wagner D, Zaroliagis C, eds. Algorithmic Methods for Railway Optimization. Lecture Notes in Computer Science, Vol. 4359 (Springer, Berlin), 145–170.CrossrefGoogle Scholar
  • Schöbel A (2009) Capacity constraints in delay management. Public Transport 1(2):135–154.CrossrefGoogle Scholar
  • Zwaneveld PJ, Kroon LG, van Hoesel SPM (2001) Routing trains through a railway station based on a node packing model. Eur. J. Oper. Res. 128(1):14–33.CrossrefGoogle 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.