Delay management including capacities of stations

OpenAccess Series in Informatics

Volumn 20, Issue , 2011, Pages 88-99

  Dollevoet, Twan ^a,b   Schmidt, Marie ^c   Schöbel, Anita ^c  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b Process Quality and Innovation Netherlands Railways   (Netherlands)

^c UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Delay management; Station capacities

Indexed keywords

CAPACITY CONSTRAINTS; DELAY MANAGEMENT; INFEASIBLE SOLUTIONS; INTEGER PROGRAMMING FORMULATIONS; ITERATIVE ALGORITHM; PLATFORM ASSIGNMENTS; STATION CAPACITIES; TOTALLY UNIMODULAR;

INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

ALGORITHMS;

EID: 84868625850     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2011.88     Document Type: Conference Paper

References (18)

1. G. Caimi, F. Chudak, M. Fuchsberger, M. Laumanns, and R. Zenklusen. A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling. Transportation Science, 45(2):212-227, 2011.
2. A. Caprara, L. Galli, and P. Toth. Solution of the train platforming problem. Transportation Science, 45(2):246-257, 2011.
3. F. Corman, A. D'Ariano, D. Pacciarelli, and M. Pranzo. Bi-objective conflict detection and resolution in railway traffic management. Transportation Research Part C: Emerging Technologies, In Press, 2010.
4. F. Corman, A. D'Ariano, D. Pacciarelli, and M. Pranzo. A tabu search algorithm for rerouting trains during rail operations. Transportation Research Part B: Methodological, 44(1):175-192, 2010.
5. A. D'Ariano, D. Pacciarelli, and M. Pranzo. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operat. Research, 183(2):643-657, 2007.
6. L. De Giovanni, G. Heilporn, and M. Labbé. Optimization models for the single delay management problem in public transportation. European Journal of Operational Research, 189(3):762-774, 2008.
7. T. Dollevoet, D. Huisman, M. Schmidt, and A. Schöbel. Delay management with re-routing of passengers. Transportation Science, 2011. to appear.
8. M. Gatto, R. Jacob, L. Peeters, and A. Schöbel. The computational complexity of delay management. In Graph-Theoretic Concepts in Computer Science: 31st International Workshop (WG 2005), volume 3787 of Lecture Notes in Computer Science, 2005.
9. L. G. Kroon, H. E. Romeijn, and P. Zwaneveld. Routing trains through railway stations: complexity issues. European Journal of Operational Research, 98(3):485-498, 1997.
10. R. Lusby, J. Larsen, M. Ehrgott, and D. Ryan. Railway track allocation: models and methods. OR Spectrum, pages 1-41, 2009. in press.
11. R. Lusby, J. Larsen, D. Ryan, and M. Ehrgott. Routing trains through railway junctions: A new set packing approach. Transportation Science, 45(2):228-245, 2011.
12. A. Mascis and D. Pacciarelli. Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3):498-517, 2002.
13. M. Schachtebeck. Delay Management in Public Transportation: Capacities, Robustness, and Integration. PhD thesis, Universität Göttingen, 2010.
14. M. Schachtebeck and A. Schöbel. To wait or not to wait and who goes first? Delay management with priority decisions. Transportation Science, 44(3):307-321, 2010.
15. A. Schöbel. A model for the delay management problem based on mixed-integer programming. Electronic Notes in Theoretical Computer Science, 50(1), 2001.
16. A. Schöbel. Capacity constraints in delay management. Public Transport, 1(2):135-154, 2009.
17. A. Schöbel. Integer programming approaches for solving the delay management problem. In Algorithmic Methods for Railway Optimization, number 4359 in Lecture Notes in Computer Science, pages 145-170. Springer, 2007.
18. A. Schrijver. Combinatorial Optimization - Polyhedra and Efficiency, volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin Heidelberg New York, 2003.