Sensitivity analysis of a railway station track layout with respect to a given timetable

European Journal of Operational Research

Volumn 112, Issue 3, 1999, Pages 517-530

  Odijk, Michiel A ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Markov chain sampling; Railway infrastructure; Strategic planning; Transportation; Uniform generation

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; PERTURBATION TECHNIQUES; PROBABILITY DISTRIBUTIONS; RAILROAD TRACKS; SCHEDULING; SENSITIVITY ANALYSIS; STRATEGIC PLANNING;

RAILWAY STATION TRACK LAYOUT;

PERT;

EID: 0033078840     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00406-2     Document Type: Article

References (21)

1. Diaconis P., Stroock D. Geometric bounds for eigenvalues of markov chains. The Annals of Applied Probability. 1(1):1991;36-61.
2. Gertsbakh I., Serafini P. Periodic transportation schedules with flexible departure times. European Journal of Operations Research. 50:1991;298-309.
3. J.S. Hooghiemstra, Design of regular interval timetables for strategic and tactical railway planning, in: J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, S. Sone (eds.), Computers in Railways, vol. 1, Computational Mechanics Publications, Southampton, 1996, pp. 393-402.
4. Jerrum M.R., Valiant L.G., Vazirani V.V. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science. 43:1986;169-188.
5. R. Kannan, Markov chains and polynomial time algorithms, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 656-671.
6. Kroon L.G., Romeijn H.E., Zwaneveld P.J. Routing trains through railway stations: Complexity issues. European Journal of Operational Research. 98:1997;485-498.
7. Odijk M.A. A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research B. 30(6):1996;455-464.
8. M.A. Odijk, Timetable-independent design and analysis of railway infrastructure, in: J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, S. Sone (Eds.), Computers in Railways, vol. 1, Computational Mechanics Publications, Southampton, 1996, pp. 3-12.
9. M.A. Odijk, Railway Timetable Generation, Ph.D. Thesis, Delft University of Technology, Delft, The Netherlands, 1997.
10. M.A. Odijk, P.J. Zwaneveld, J.S. Hooghiemstra, L.G. Kroon, M. Salomon, Decision support systems help railned to search for Win-Win solutions in railway network design (to appear in Interfaces).
11. R.T. Rockafellar, Network Flows and Monotropic Optimization, Wiley, New York, 1984.
12. C.P. Schnorr, Optimal Algorithms for Self-reducible Problems, Proceedings of the Third International Colloquium on Automata, Languages, and Programming, 1976, pp. 322-337.
13. A. Schrijver, A. Steenbeek, Dienstregelingontwikkeling voor Railned - Rapport CADANS 1.0., (in Dutch) Report, Center for Mathematics and Computer Science, Amsterdam, 1994.
14. Serafini P., Ukovich W. A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics. 2:1989;550-581.
15. Serafini P., Ukovich W. A mathematical model for the fixed-time traffic control problem. European Journal of Operations Research. 42:1989;152-165.
16. A.J. Sinclair, Algorithms for Random Generation And Counting: A Markov Chain Approach, Birkhäuser, Boston, 1992.
17. J.H.A. Van den Berg, M.A. Odijk, DONS: Computer aided design of regular service timetables, in: T.K.S. Murthy, C.A. Brebbia, B. Mellitt, G. Sciutto, S. Sone (Eds.), Computers in Railways vol. IV, no. 2, Computational Mechanics Publications, Southampton, 1994, pp. 109-116.
18. M. Voorhoeve, Rail scheduling with discrete sets, Working paper (draft), Eindhoven University of Technology, Eindhoven, The Netherlands, 1993.
19. Zwaneveld P.J., Kroon L.G., Romeijn H.E., Salomon M., Dauzère-Pérès S., Van Hoesel C.P.M., Ambergen H.W. Routing trains through railway stations: Model formulation and algorithms. Transportation Science. 30(3):1996;181-194.
20. P.J. Zwaneveld, L.G. Kroon, H.W. Ambergen, A decision support system for routing trains through railway station, in: J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, S. Sone (Eds.), Computers in Railways, vol. 2, Computational Mechanics Publications, Southampton, 1996, 217-226.
21. P.J. Zwaneveld, Railway Planning: Routing Trains and Allocation of Passenger Lines, Ph.D. Thesis, Erasmus University Rotterdam, Rotterdam, and TRAIL, Delft, The Netherlands, 1997.