메뉴 건너뛰기




Volumn 35, Issue 3, 1998, Pages 233-246

Hybrid simulation for resolving resource conflicts in train traffic rescheduling

Author keywords

Event driven simulation; Network based simulation; Rescheduling; Resource conflicts; Train traffic control

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; SCHEDULING;

EID: 0032050958     PISSN: 01663615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-3615(97)00071-7     Document Type: Article
Times cited : (43)

References (18)
  • 1
    • 0025701908 scopus 로고
    • A heuristic for multi-project scheduling with limited resources in the housing industry
    • S. Tsubakitani, R.F. Deckro, A heuristic for multi-project scheduling with limited resources in the housing industry, Eur. J. Operations Res. 49 (1990) 80-90.
    • (1990) Eur. J. Operations Res. , vol.49 , pp. 80-90
    • Tsubakitani, S.1    Deckro, R.F.2
  • 2
    • 0023830557 scopus 로고
    • GATES: An airline gate assignment and tracking expert system
    • R.P. Brazile, K.M. Swigger. GATES: An airline gate assignment and tracking expert system, IEEE Expert, 1988, pp. 33-39.
    • (1988) IEEE Expert , pp. 33-39
    • Brazile, R.P.1    Swigger, K.M.2
  • 3
    • 0026104713 scopus 로고
    • Tactical scheduling of rail operations: The SCAN I system
    • D. Jovanovic, P.T. Harker, Tactical scheduling of rail operations: The SCAN I system, Transportation Sci. 25 (1) (1991) 46-64.
    • (1991) Transportation Sci. , vol.25 , Issue.1 , pp. 46-64
    • Jovanovic, D.1    Harker, P.T.2
  • 4
    • 0029236610 scopus 로고
    • A model, algorithm and strategy for train pathing
    • M. Carey, D. Lockwood, A model, algorithm and strategy for train pathing, J. Operational Res. Soc. 46 (1995) 988-1005.
    • (1995) J. Operational Res. Soc. , vol.46 , pp. 988-1005
    • Carey, M.1    Lockwood, D.2
  • 5
    • 0028530808 scopus 로고
    • A model and strategy for train pathing, with choice of lines, platforms and routes
    • M. Carey, A model and strategy for train pathing, with choice of lines, platforms and routes, Transportation Res. 28B (1994) 333-353.
    • (1994) Transportation Res. , vol.28 B , pp. 333-353
    • Carey, M.1
  • 6
    • 0028532251 scopus 로고
    • Extending a train pathing algorithm from one-way to two-way track
    • M. Carey, Extending a train pathing algorithm from one-way to two-way track, Transportation Res. 28B (1994) 395-400.
    • (1994) Transportation Res. , vol.28 B , pp. 395-400
    • Carey, M.1
  • 9
    • 0026371421 scopus 로고
    • A new simulation method and its application to knowledge-based systems for railway scheduling
    • K. Komaya. A new simulation method and its application to knowledge-based systems for railway scheduling. Proceedings of the IEEE/ASME Joint Railway Conference, 1991, pp. 59-66.
    • (1991) Proceedings of the IEEE/ASME Joint Railway Conference , pp. 59-66
    • Komaya, K.1
  • 11
    • 0027845238 scopus 로고
    • RTTRS: Rule-based train traffic reschedule simulator
    • English Edition
    • Y. Cheng, RTTRS: Rule-based train traffic reschedule simulator, Chinese J. Sys. Eng. Electron. 4 (1993) 73-81, English Edition.
    • (1993) Chinese J. Sys. Eng. Electron. , vol.4 , pp. 73-81
    • Cheng, Y.1
  • 15
    • 0346850137 scopus 로고
    • Production scheduling and neural networks
    • Berlin, 1994, Published by Spring-Verlag
    • W. Wang, P. Brunn. Production scheduling and neural networks. Operations Research proceedings (Selected papers of the Intl. conference on Operations Research, Berlin, 1994), Published by Spring-Verlag, 1994, pp. 173-178.
    • (1994) Intl. Conference on Operations Research , pp. 173-178
    • Wang, W.1    Brunn, P.2
  • 16
    • 0043177299 scopus 로고
    • Train traffic simulation using the longest path method
    • in Japanese
    • K. Abe, S. Araya, Train traffic simulation using the longest path method, J. Information Processing Jpn. 27 (1986) 103-111, in Japanese.
    • (1986) J. Information Processing Jpn. , vol.27 , pp. 103-111
    • Abe, K.1    Araya, S.2


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