메뉴 건너뛰기




Volumn 20, Issue 1, 2012, Pages 62-78

Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances

Author keywords

Disturbance management; Optimization; Railway traffic; Scheduling; Slot allocation; Timetabling

Indexed keywords

AIR TRAFFIC CONTROL; COST EFFECTIVENESS; DECISION SUPPORT SYSTEMS; MANAGERS; OPTIMIZATION; RAILROAD TRANSPORTATION; RAILROADS;

EID: 80054777781     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2010.12.004     Document Type: Article
Times cited : (187)

References (24)
  • 1
    • 0019230108 scopus 로고
    • Models for rail transportation
    • Assad A. Models for rail transportation. Transportation Research Part A 1980, 14A:205-220.
    • (1980) Transportation Research Part A , vol.14 A , pp. 205-220
    • Assad, A.1
  • 2
    • 85029851656 scopus 로고    scopus 로고
    • Banverket, 2009. Årsredovisning 2008 (in Swedish), Borlänge, Sweden.
    • Banverket, 2009. Årsredovisning 2008 (in Swedish), Borlänge, Sweden.
  • 3
    • 85029848203 scopus 로고    scopus 로고
    • Banverket, 2008. Årsredovisning 2007 (in Swedish), Borlänge, Sweden.
    • Banverket, 2008. Årsredovisning 2007 (in Swedish), Borlänge, Sweden.
  • 4
    • 85029872612 scopus 로고    scopus 로고
    • Banverket, 2007. Årsredovisning 2006 (in Swedish), Borlänge, Sweden.
    • Banverket, 2007. Årsredovisning 2006 (in Swedish), Borlänge, Sweden.
  • 5
    • 85029829806 scopus 로고    scopus 로고
    • Banverket, 2006. Årsredovisning 2005 (in Swedish), Borlänge, Sweden.
    • Banverket, 2006. Årsredovisning 2005 (in Swedish), Borlänge, Sweden.
  • 6
    • 85029833720 scopus 로고    scopus 로고
    • Banverket, 2005. Årsredovisning 2004 (in Swedish), Borlänge, Sweden.
    • Banverket, 2005. Årsredovisning 2004 (in Swedish), Borlänge, Sweden.
  • 7
    • 0042205090 scopus 로고    scopus 로고
    • Using integer programming to solve the train-platforming problem
    • Billionnet A. Using integer programming to solve the train-platforming problem. Transportation Science 2003, 37(2):213-222.
    • (2003) Transportation Science , vol.37 , Issue.2 , pp. 213-222
    • Billionnet, A.1
  • 8
    • 0032203702 scopus 로고    scopus 로고
    • A survey of optimization models for train routing and scheduling
    • Cordeau J-F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Science 1998, 32(4):380-404.
    • (1998) Transportation Science , vol.32 , Issue.4 , pp. 380-404
    • Cordeau, J.-F.1    Toth, P.2    Vigo, D.3
  • 10
    • 59749089450 scopus 로고    scopus 로고
    • An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances
    • D'Ariano A., Pranzo M. An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances. Networks and Spatial Economics 2009, 9:63-84.
    • (2009) Networks and Spatial Economics , vol.9 , pp. 63-84
    • D'Ariano, A.1    Pranzo, M.2
  • 11
    • 39849100700 scopus 로고    scopus 로고
    • Single-threaded vs. multithreaded: Where should we focus?
    • Emer J., Hill M., Patt Y., Yi J., Chiou D., Sendag R. Single-threaded vs. multithreaded: Where should we focus?. IEEE Micro 2007, 27(6):14-24.
    • (2007) IEEE Micro , vol.27 , Issue.6 , pp. 14-24
    • Emer, J.1    Hill, M.2    Patt, Y.3    Yi, J.4    Chiou, D.5    Sendag, R.6
  • 12
    • 80054781432 scopus 로고    scopus 로고
    • European Commission, European transport policy: time to decide 2010. White paper.
    • European Commission, 2001. European transport policy: time to decide 2010. White paper.
    • (2001)
  • 13
    • 85029872128 scopus 로고    scopus 로고
    • A multi scalable model based on a connexity graph representation. In: Proceedings of Comprail 2008, Toledo, Spain.
    • Gely, L., Dessagne, G., Pesneau, P., Vanderbeck, F., 2008. A multi scalable model based on a connexity graph representation. In: Proceedings of Comprail 2008, Toledo, Spain.
    • (2008)
    • Gely, L.1    Dessagne, G.2    Pesneau, P.3    Vanderbeck, F.4
  • 14
    • 80054780052 scopus 로고    scopus 로고
    • En pilotstudie av punktligheten i Europeiska godstransporter på järnväg. TFK Rapport 2003: Stockholm, Sweden.
    • Jansson, G., Jonsson, O., 2003. En pilotstudie av punktligheten i Europeiska godstransporter på järnväg. TFK Rapport 2003:7, Stockholm, Sweden.
    • (2003) , vol.7
    • Jansson, G.1    Jonsson, O.2
  • 15
    • 80054779961 scopus 로고    scopus 로고
    • Rescheduling
    • Eurailpress, Hamburg, Germany, Hansen, Pachl (Eds.) Railway Timetable & Traffic
    • Jacobs J. Rescheduling. Analysis, Modelling, Simulation 2008, 182-191. Eurailpress, Hamburg, Germany. Hansen, Pachl (Eds.).
    • (2008) Analysis, Modelling, Simulation , pp. 182-191
    • Jacobs, J.1
  • 16
    • 80054785660 scopus 로고    scopus 로고
    • Optimization models for railway timetabling
    • Eurailpress, Hamburg, Germany, Hansen, Pachl (Eds.) Railway Timetable & Traffic
    • Kroon L., Huisman D., Maróti G. Optimization models for railway timetabling. Analysis, Modelling, Simulation 2008, 135-154. Eurailpress, Hamburg, Germany. Hansen, Pachl (Eds.).
    • (2008) Analysis, Modelling, Simulation , pp. 135-154
    • Kroon, L.1    Huisman, D.2    Maróti, G.3
  • 18
    • 78751476439 scopus 로고    scopus 로고
    • Infrastructure modelling
    • Eurailpress, Hamburg, Germany, Hansen, Pachl (Eds.) Railway Timetable & Traffic
    • Radtke A. Infrastructure modelling. Analysis, Modelling, Simulation 2008, 43-57. Eurailpress, Hamburg, Germany. Hansen, Pachl (Eds.).
    • (2008) Analysis, Modelling, Simulation , pp. 43-57
    • Radtke, A.1
  • 19
    • 77955597779 scopus 로고    scopus 로고
    • Capacity constraints in delay management
    • Schöbel A. Capacity constraints in delay management. Journal of Public Transport 2009, 1(2):135-154.
    • (2009) Journal of Public Transport , vol.1 , Issue.2 , pp. 135-154
    • Schöbel, A.1
  • 20
    • 85029879325 scopus 로고    scopus 로고
    • Computer-based decision support for railway traffic scheduling and dispatching: a review of models and algorithms. In: Proceedings of ATMOS2005, Palma de Mallorca, Spain, October 2005, Published within the Dagstuhl Research Online Publication Server (DROPS) <>
    • Törnquist, J., 2005. Computer-based decision support for railway traffic scheduling and dispatching: a review of models and algorithms. In: Proceedings of ATMOS2005, Palma de Mallorca, Spain, October 2005, Published within the Dagstuhl Research Online Publication Server (DROPS) <>. http://drops.dagstuhl.de/portals/ATMOS/.
    • (2005)
    • Törnquist, J.1
  • 21
    • 33845266135 scopus 로고    scopus 로고
    • N-tracked railway traffic re-scheduling during disturbances
    • Törnquist J., Persson J. N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B 2007, 41(3):342-362.
    • (2007) Transportation Research Part B , vol.41 , Issue.3 , pp. 342-362
    • Törnquist, J.1    Persson, J.2
  • 22
    • 36448977879 scopus 로고    scopus 로고
    • Railway traffic disturbance management: an experimental analysis of disturbance complexity, management objectives and limitations in planning horizon
    • Törnquist J. Railway traffic disturbance management: an experimental analysis of disturbance complexity, management objectives and limitations in planning horizon. Transportation Research Part A 2007, 41(3):249-266.
    • (2007) Transportation Research Part A , vol.41 , Issue.3 , pp. 249-266
    • Törnquist, J.1
  • 23
    • 85029845605 scopus 로고    scopus 로고
    • UIRR (International Union of combined Road-Rail transport companies), 2008. Punctuality statistics for 1999-2007. <> (accessed 01.09.09).
    • UIRR (International Union of combined Road-Rail transport companies), 2008. Punctuality statistics for 1999-2007. <> (accessed 01.09.09). http://www.uirr.com/?action=page&page=52&title=Quality.
  • 24
    • 33845274298 scopus 로고    scopus 로고
    • Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds
    • Zhou X., Zhong M. Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B 2007, 41(3):320-342.
    • (2007) Transportation Research Part B , vol.41 , Issue.3 , pp. 320-342
    • Zhou, X.1    Zhong, M.2


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