메뉴 건너뛰기




Volumn 20, Issue , 2011, Pages 1-14

Real-time traffic control in railway systems

Author keywords

Integer linear programming; Real time traffic control; Train timetabling

Indexed keywords

EUROPEAN RAILWAYS; FULLY AUTOMATED; GOODS TRANSPORT; INTEGER LINEAR PROGRAMMING; MIXED INTEGER PROGRAMMING; REAL-TIME TRAFFIC CONTROL; TERMINAL STATIONS; TRAIN TIMETABLING;

EID: 84882970149     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2011.1     Document Type: Conference Paper
Times cited : (7)

References (14)
  • 1
    • 21044452195 scopus 로고    scopus 로고
    • A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
    • Ahuja, R.K., D.S. Hochbaum, J.B. Orlin, A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem, Algorithmica 39 (2004) pp. 189-208.
    • (2004) Algorithmica , vol.39 , pp. 189-208
    • Ahuja, R.K.1    Hochbaum, D.S.2    Orlin, J.B.3
  • 2
    • 0002381223 scopus 로고
    • Machine sequencing via disjunctive graphs
    • Balas, E., Machine sequencing via disjunctive graphs, Operations Research 17 (1969) pp. 941-957.
    • (1969) Operations Research , vol.17 , pp. 941-957
    • Balas, E.1
  • 3
    • 79957466386 scopus 로고    scopus 로고
    • Solution of the train platforming problem
    • A. Caprara A., L. Galli, P. Toth. Solution of the Train Platforming Problem, Transportation Science, 45 (2), pp 246-257, 2011.
    • (2011) Transportation Science , vol.45 , Issue.2 , pp. 246-257
    • Caprara, A.1    Galli, L.2    Toth, P.3
  • 6
    • 0001559895 scopus 로고
    • Formulating the single machine sequencing problem with release dates as a mixed integer program
    • Dyer., M., L. Wolsey, Formulating the single machine sequencing problem with release dates as a mixed integer program, Discrete Applied Mathematics, no. 26 (2-3), pp. 255-270, 1990.
    • (1990) Discrete Applied Mathematics , vol.26 , Issue.2-3 , pp. 255-270
    • Dyer, M.1    Wolsey, L.2
  • 7
    • 0001764412 scopus 로고
    • Finding minimum cost circulation by successive approximation
    • Goldberg, A.V., R. Tarjan, Finding minimum cost circulation by successive approximation, Math. of Op. Res., 15, pp. 430-466, 1990.
    • (1990) Math. of Op. Res. , vol.15 , pp. 430-466
    • Goldberg, A.V.1    Tarjan, R.2
  • 10
    • 69949109733 scopus 로고    scopus 로고
    • Real-time traffic control in metro stations
    • C. Mannino, A. Mascis, Real-time Traffic Control in Metro Stations, Operations Research, 57 (4), pp 1026-1039, 2009
    • (2009) Operations Research , vol.57 , Issue.4 , pp. 1026-1039
    • Mannino, C.1    Mascis, A.2
  • 11
    • 84882979078 scopus 로고    scopus 로고
    • Compact VS non-compact MILP formulations for railway traffic control in single-track lines
    • C. Mannino, T. Nygreen Compact VS non-compact MILP formulations for Railway Traffic Control in Single-track lines, working paper, University of Oslo, 2011
    • (2011) Working Paper, University of Oslo
    • Mannino, C.1    Nygreen, T.2
  • 12
    • 0037121475 scopus 로고    scopus 로고
    • Job shop scheduling with blocking and no-wait constraints
    • Mascis A., D. Pacciarelli, Job shop scheduling with blocking and no-wait constraints, European Journal of Operational Research, 143 (3), pp. 498-517, 2002.
    • (2002) European Journal of Operational Research , vol.143 , Issue.3 , pp. 498-517
    • Mascis, A.1    Pacciarelli, D.2


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