메뉴 건너뛰기




Volumn 41, Issue 1, 2014, Pages 150-166

Determining operations affected by delay in predictive train timetables

Author keywords

Job shops; Robustness; Sensitivity analysis; Topological ordering; Train scheduling; Transitive closure

Indexed keywords

CONTROL INFORMATION; DISJUNCTIVE GRAPHS; JOB SHOP; TIME-CONSUMING TASKS; TOPOLOGICAL ORDER; TRAIN OPERATIONS; TRAIN SCHEDULING; TRANSITIVE CLOSURE;

EID: 84883503556     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.08.011     Document Type: Article
Times cited : (24)

References (26)
  • 1
    • 84883740900 scopus 로고    scopus 로고
    • A practical approach for identifying expected solution performance and robustness in Operations Research applications
    • R. Burdett, and E. Kozan A practical approach for identifying expected solution performance and robustness in Operations Research applications ASOR Bulletin 31 2 2010 1 28
    • (2010) ASOR Bulletin , vol.31 , Issue.2 , pp. 1-28
    • Burdett, R.1    Kozan, E.2
  • 2
    • 84883741788 scopus 로고    scopus 로고
    • A sensitivity analysis for predictive train timetables: Quantifying the effect of delay by performance profiling
    • Working paper
    • Burdett R, Kozan E. A sensitivity analysis for predictive train timetables: quantifying the effect of delay by performance profiling. QUT Eprints 2013. Working paper.
    • QUT Eprints 2013
    • Burdett, R.1    Kozan, E.2
  • 3
    • 71149091242 scopus 로고    scopus 로고
    • A sequencing approach for train timetabling
    • R. Burdett, and E. Kozan A sequencing approach for train timetabling OR Spectrum 32 1 2010 163 193
    • (2010) OR Spectrum , vol.32 , Issue.1 , pp. 163-193
    • Burdett, R.1    Kozan, E.2
  • 4
    • 69249227506 scopus 로고    scopus 로고
    • Development of a disjunctive graph model and framework for constructing new train schedules
    • R. Burdett, and E. Kozan Development of a disjunctive graph model and framework for constructing new train schedules European Journal of Operational Research 200 1 2010 85 98
    • (2010) European Journal of Operational Research , vol.200 , Issue.1 , pp. 85-98
    • Burdett, R.1    Kozan, E.2
  • 5
    • 67651174323 scopus 로고    scopus 로고
    • Techniques for inserting additional trains into existing timetables
    • R. Burdett, and E. Kozan Techniques for inserting additional trains into existing timetables Transportation Research B 43 8 2009 821 836
    • (2009) Transportation Research B , vol.43 , Issue.8 , pp. 821-836
    • Burdett, R.1    Kozan, E.2
  • 7
    • 65849438839 scopus 로고    scopus 로고
    • Techniques for restricting multiple overtaking conflicts and performing compound moves when train scheduling
    • R. Burdett, and E. Kozan Techniques for restricting multiple overtaking conflicts and performing compound moves when train scheduling Mathematical and Computer Modelling 50 1-2 2009 314 328
    • (2009) Mathematical and Computer Modelling , vol.50 , Issue.12 , pp. 314-328
    • Burdett, R.1    Kozan, E.2
  • 9
    • 62549158188 scopus 로고    scopus 로고
    • Scheduling trains as a blocking parallel-machine job shop scheduling problem
    • S.Q. Liu, and E. Kozan Scheduling trains as a blocking parallel-machine job shop scheduling problem Computers and Operations Research 36 10 2009 2840 2852
    • (2009) Computers and Operations Research , vol.36 , Issue.10 , pp. 2840-2852
    • Liu, S.Q.1    Kozan, E.2
  • 10
    • 79957454187 scopus 로고    scopus 로고
    • Scheduling trains with priorities: A no-wait blocking parallel machine job shop scheduling model
    • S.Q. Liu, and E. Kozan Scheduling trains with priorities: a no-wait blocking parallel machine job shop scheduling model Transportation Science 45 2 2011 175 198
    • (2011) Transportation Science , vol.45 , Issue.2 , pp. 175-198
    • Liu, S.Q.1    Kozan, E.2
  • 11
    • 33646681684 scopus 로고    scopus 로고
    • Techniques for absolute capacity determination in railways
    • R. Burdett, and E. Kozan Techniques for absolute capacity determination in railways Transportation Research B 40 8 2006 616 632
    • (2006) Transportation Research B , vol.40 , Issue.8 , pp. 616-632
    • Burdett, R.1    Kozan, E.2
  • 12
    • 10644237939 scopus 로고    scopus 로고
    • Simultaneous disruption recovery of a train timetable and crew roster in real time
    • C.G. Walker, J.N. Snowdon, and D.M. Ryan Simultaneous disruption recovery of a train timetable and crew roster in real time Computers and Operations Research 32 2005 2077 2094
    • (2005) Computers and Operations Research , vol.32 , pp. 2077-2094
    • Walker, C.G.1    Snowdon, J.N.2    Ryan, D.M.3
  • 13
    • 70449133340 scopus 로고    scopus 로고
    • The train driver recovery problem - A set partitioning based model and solution method
    • N.J. Rezanova, and D.M. Ryan The train driver recovery problem - a set partitioning based model and solution method Computers and Operations Research 37 2010 845 856
    • (2010) Computers and Operations Research , vol.37 , pp. 845-856
    • Rezanova, N.J.1    Ryan, D.M.2
  • 16
    • 70449635732 scopus 로고    scopus 로고
    • Reordering and local rerouting strategies to manage train traffic in real time
    • A. D'Ariano, F. Corman, D. Pacciarelli, and M. Pranzo Reordering and local rerouting strategies to manage train traffic in real time Transportation Science 42 4 2008 405 419
    • (2008) Transportation Science , vol.42 , Issue.4 , pp. 405-419
    • D'Ariano, A.1    Corman, F.2    Pacciarelli, D.3    Pranzo, M.4
  • 20
    • 84859746288 scopus 로고    scopus 로고
    • A lagrangian heuristic for robustness, with an application to train timetabling
    • V. Cacchiani, A. Caprara, and M. Fischetti A lagrangian heuristic for robustness, with an application to train timetabling Transportation Science 46 1 2012 124 133
    • (2012) Transportation Science , vol.46 , Issue.1 , pp. 124-133
    • Cacchiani, V.1    Caprara, A.2    Fischetti, M.3
  • 21
    • 70449640336 scopus 로고    scopus 로고
    • Fast approaches to improve the robustness of a railway timetable
    • M. Fischetti, D. Salvagnin, and A. Zanette Fast approaches to improve the robustness of a railway timetable Transportation Science 43 2009 321 335
    • (2009) Transportation Science , vol.43 , pp. 321-335
    • Fischetti, M.1    Salvagnin, D.2    Zanette, A.3
  • 24
    • 33747832752 scopus 로고    scopus 로고
    • Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
    • C. Demetrescu, and G.F. Italiano Dynamic shortest paths and transitive closure: algorithmic techniques and data structures Journal of Discrete Algorithms 4 2006 353 383
    • (2006) Journal of Discrete Algorithms , vol.4 , pp. 353-383
    • Demetrescu, C.1    Italiano, G.F.2
  • 25
    • 34247553345 scopus 로고    scopus 로고
    • Improved decremental algorithms for maintaining transitive closure and all pairs shortest paths
    • S. Baswana, R. Hariharan, and S. Sen Improved decremental algorithms for maintaining transitive closure and all pairs shortest paths Journal of Algorithms 62 2007 74 92
    • (2007) Journal of Algorithms , vol.62 , pp. 74-92
    • Baswana, S.1    Hariharan, R.2    Sen, S.3


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