메뉴 건너뛰기




Volumn 5, Issue 1-2, 2013, Pages 95-123

Rescheduling models for railway traffic management in large-scale networks

Author keywords

Alternative graph; Delay propagation; Macroscopic modeling; Railway traffic management; Timed event graph

Indexed keywords

ALTERNATIVE GRAPHS; DELAY PROPAGATION; MACROSCOPIC MODEL; RAILWAY TRAFFIC MANAGEMENT; TIMED EVENT GRAPHS;

EID: 84883393703     PISSN: 1866749X     EISSN: 16137159     Source Type: Journal    
DOI: 10.1007/s12469-013-0063-y     Document Type: Article
Times cited : (72)

References (33)
  • 3
    • 84859705420 scopus 로고    scopus 로고
    • A model-predictive control approach for discrete-time rescheduling in complex central railway station areas
    • Caimi G, Fuchsberger M, Laumanns M, Lüthi M (2012) A model-predictive control approach for discrete-time rescheduling in complex central railway station areas. Comput Oper Res 39(11): 2578-2593.
    • (2012) Comput Oper Res , vol.39 , Issue.11 , pp. 2578-2593
    • Caimi, G.1    Fuchsberger, M.2    Laumanns, M.3    Lüthi, M.4
  • 4
    • 77956307098 scopus 로고    scopus 로고
    • Rescheduling dense train traffic over complex station interlocking areas
    • LNCS, R. K. Ahuja (Ed.), Berlin/Heidelberg: Springer
    • Corman F, Goverde RMP, D'Ariano A (2009) Rescheduling dense train traffic over complex station interlocking areas. In: Ahuja RK et al. (eds) Robust and online large-scale optimization. LNCS, vol 5868. Springer, Berlin/Heidelberg, pp 100-111.
    • (2009) Robust and Online Large-Scale Optimization , vol.5868 , pp. 100-111
    • Corman, F.1    Goverde, R.M.P.2    D'Ariano, A.3
  • 5
    • 79953200769 scopus 로고    scopus 로고
    • Centralized versus distributed systems to reschedule trains in two dispatching areas
    • Corman F, D'Ariano A, Pacciarelli D, Pranzo M (2010) Centralized versus distributed systems to reschedule trains in two dispatching areas. Public Transp 2(3): 219-247.
    • (2010) Public Transp , vol.2 , Issue.3 , pp. 219-247
    • Corman, F.1    D'Ariano, A.2    Pacciarelli, D.3    Pranzo, M.4
  • 10
    • 34249982545 scopus 로고    scopus 로고
    • A branch and bound algorithm for scheduling trains in a railway network
    • D'Ariano A, Pacciarelli D, Pranzo M (2007a) A branch and bound algorithm for scheduling trains in a railway network. Eur J Oper Res 183(2): 643-657.
    • (2007) Eur J Oper Res , vol.183 , Issue.2 , pp. 643-657
    • D'Ariano, A.1    Pacciarelli, D.2    Pranzo, M.3
  • 11
    • 34249889301 scopus 로고    scopus 로고
    • Conflict resolution and train speed coordination for solving real-time timetable perturbations
    • D'Ariano A, Pranzo M, Hansen IA (2007b) Conflict resolution and train speed coordination for solving real-time timetable perturbations. IEEE Trans Intell Transp Syst 8(2): 208-222.
    • (2007) IEEE Trans Intell Transp Syst , vol.8 , Issue.2 , pp. 208-222
    • D'Ariano, A.1    Pranzo, M.2    Hansen, I.A.3
  • 12
    • 33748691351 scopus 로고    scopus 로고
    • Railway timetable stability analysis using max-plus system theory
    • Goverde RMP (2007) Railway timetable stability analysis using max-plus system theory. Transp Res, Part B, Methodol 41(2): 179-201.
    • (2007) Transp Res, Part B, Methodol , vol.41 , Issue.2 , pp. 179-201
    • Goverde, R.M.P.1
  • 13
    • 77952289414 scopus 로고    scopus 로고
    • A delay propagation algorithm for large-scale railway traffic networks
    • Goverde RMP (2010) A delay propagation algorithm for large-scale railway traffic networks. Transp Res, Part C, Emerg Technol 18(3): 269-287.
    • (2010) Transp Res, Part C, Emerg Technol , vol.18 , Issue.3 , pp. 269-287
    • Goverde, R.M.P.1
  • 15
    • 0030396274 scopus 로고    scopus 로고
    • Design of regular interval timetables for strategic and tactical railway planning
    • J. Allan, C. A. Brebbia, R. J. Hill, G. Sciutto, and S. Sone (Eds.), Southampton: Computational Mechanics Publications
    • Hooghiemstra JS (1996) Design of regular interval timetables for strategic and tactical railway planning. In: Allan J, Brebbia CA, Hill RJ, Sciutto G, Sone S (eds) Computers in railways V. Computational Mechanics Publications, Southampton, pp 393-402.
    • (1996) Computers in Railways V , pp. 393-402
    • Hooghiemstra, J.S.1
  • 16
    • 34249902848 scopus 로고    scopus 로고
    • Reducing delays by means of 'on the spot' reschdeduling
    • J. Allan, C. A. Brebbia, R. J. Hill, G. Sciutto, and S. Sone (Eds.), Southampton: WIT Press
    • Jacobs J (2004) Reducing delays by means of 'on the spot' reschdeduling. In: Allan J, Brebbia CA, Hill RJ, Sciutto G, Sone S (eds) Computers in railways IX. WIT Press, Southampton, pp 603-612.
    • (2004) Computers in Railways IX , pp. 603-612
    • Jacobs, J.1
  • 19
    • 0037121475 scopus 로고    scopus 로고
    • Job-shop scheduling with blocking and no-wait constraints
    • Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143: 498-517.
    • (2002) Eur J Oper Res , vol.143 , pp. 498-517
    • Mascis, A.1    Pacciarelli, D.2
  • 20
    • 79961119633 scopus 로고    scopus 로고
    • Models and algorithms for traffic management of rail networks
    • Dipartimento di Informatica e Automazione, Roma Tre
    • Mascis A, Pacciarelli D, Pranzo M (2002) Models and algorithms for traffic management of rail networks. In: Tech. Rep. RT-DIA-074-2002, pp 1-30, Dipartimento di Informatica e Automazione, Roma Tre.
    • (2002) Tech. Rep. RT-DIA-074-2002 , pp. 1-30
    • Mascis, A.1    Pacciarelli, D.2    Pranzo, M.3
  • 21
    • 78650824016 scopus 로고    scopus 로고
    • An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network
    • Min YH, Park MJ, Hong SP, Hong SH (2011) An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network. Transp Res, Part B, Methodol 45(2): 409-429.
    • (2011) Transp Res, Part B, Methodol , vol.45 , Issue.2 , pp. 409-429
    • Min, Y.H.1    Park, M.J.2    Hong, S.P.3    Hong, S.H.4
  • 22
    • 4644276020 scopus 로고    scopus 로고
    • Railroad simulation using OpenTrack
    • J. Allan (Ed.), Southampton: WIT Press
    • Nash A, Huerlimann D (2004) Railroad simulation using OpenTrack. In: Allan J et al. (eds) Computers in railways IX. WIT Press, Southampton, pp 45-54.
    • (2004) Computers in Railways IX , pp. 45-54
    • Nash, A.1    Huerlimann, D.2
  • 23
    • 84883336115 scopus 로고    scopus 로고
    • Network Statement, Utrecht, Netherlands (2012)
    • Network Statement (2013) In: ProRail, Utrecht, Netherlands (2012).
    • (2013) ProRail
  • 24
    • 77955639714 scopus 로고    scopus 로고
    • To wait or not to wait-and who goes first? Delay management with priority decisions
    • Schachtebeck M, Schöbel A (2010) To wait or not to wait-and who goes first? Delay management with priority decisions. Transp Sci 44(3): 307-321.
    • (2010) Transp Sci , vol.44 , Issue.3 , pp. 307-321
    • Schachtebeck, M.1    Schöbel, A.2
  • 26
    • 49949111098 scopus 로고    scopus 로고
    • Integer programming approaches for solving the delay management problem
    • LNCS, F. Geraets (Ed.), Berlin/Heidelberg: Springer
    • Schöbel A (2007) Integer programming approaches for solving the delay management problem. In: Geraets F et al. (eds) Railway optimization. LNCS, vol 4359. Springer, Berlin/Heidelberg, pp 145-170.
    • (2007) Railway Optimization , vol.4359 , pp. 145-170
    • Schöbel, A.1
  • 28
    • 84883359514 scopus 로고    scopus 로고
    • Sporenplan
    • Sporenplan (2013) www. sporenplan. nl.
    • (2013)
  • 29
    • 23044525568 scopus 로고    scopus 로고
    • Design of customer-oriented dispatching support for railways
    • S. Voß and J. Daduna (Eds.), Berlin: Springer
    • Suhl L, Biederbick C, Kliewer N (2001) Design of customer-oriented dispatching support for railways. In: VoßS, Daduna J (eds) Computer-aided transit scheduling. LNEMS, vol 505. Springer, Berlin, pp 365-386.
    • (2001) Computer-Aided Transit Scheduling. LNEMS , vol.505 , pp. 365-386
    • Suhl, L.1    Biederbick, C.2    Kliewer, N.3
  • 30
    • 26944478149 scopus 로고    scopus 로고
    • Train rescheduling algorithm which minimizes passengers' dissatisfaction
    • LNCS, M. Ali and F. Esposito (Eds.), Berlin/Heidelberg: Springer
    • Tomii N, Yoshiaki T, Noriyuki T, Chikara H, Kunimitsu M (2005) Train rescheduling algorithm which minimizes passengers' dissatisfaction. In: Ali M, Esposito F (eds) Innovations in applied artificial intelligence. LNCS, vol 3533. Springer, Berlin/Heidelberg, pp 37-43.
    • (2005) Innovations in Applied Artificial Intelligence , vol.3533 , pp. 37-43
    • Tomii, N.1    Yoshiaki, T.2    Noriyuki, T.3    Chikara, H.4    Kunimitsu, M.5
  • 31
    • 80054777781 scopus 로고    scopus 로고
    • Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances
    • Törnquist Krasemann J (2011) Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances. Transp Res, Part C, Emerg Technol 20: 62-78.
    • (2011) Transp Res, Part C, Emerg Technol , vol.20 , pp. 62-78
    • Törnquist Krasemann, J.1
  • 32
    • 33845266135 scopus 로고    scopus 로고
    • N-tracked railway traffic re-scheduling during disturbances
    • Törnquist J, Persson J (2007) N-tracked railway traffic re-scheduling during disturbances. Transp Res, Part B, Methodol 41(3): 342-362.
    • (2007) Transp Res, Part B, Methodol , vol.41 , Issue.3 , pp. 342-362
    • Törnquist, J.1    Persson, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.