메뉴 건너뛰기




Volumn 48, Issue 2, 2014, Pages 119-137

Design and analysis of demand-adapted railway timetables

Author keywords

mixed integer nonlinear programming; quality of service; train timetabling; variable demand

Indexed keywords

DESIGN AND ANALYSIS; MIXED-INTEGER NONLINEAR PROGRAMMING; NON-LINEAR INTEGER PROGRAMMING; OPTIMIZATION MODELING; OPTIMIZATION PROBLEMS; RAPID TRANSIT SYSTEMS; TRAIN TIMETABLING; VARIABLE DEMANDS;

EID: 84897653892     PISSN: 01976729     EISSN: 20423195     Source Type: Journal    
DOI: 10.1002/atr.1261     Document Type: Article
Times cited : (118)

References (34)
  • 4
    • 0032206316 scopus 로고    scopus 로고
    • Modeling train delays in urban networks
    • Higgins A, Kozan E,. Modeling train delays in urban networks. Transportation Science 1998; 32 (4): 346-357.
    • (1998) Transportation Science , vol.32 , Issue.4 , pp. 346-357
    • Higgins, A.1    Kozan, E.2
  • 6
    • 0008917539 scopus 로고
    • A mathematical model for periodic scheduling problems
    • Serafini P, Ukovich W,. A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 1989; 2 (4): 550-581.
    • (1989) SIAM Journal on Discrete Mathematics , vol.2 , Issue.4 , pp. 550-581
    • Serafini, P.1    Ukovich, W.2
  • 8
    • 0031351812 scopus 로고    scopus 로고
    • Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks
    • Nachtigall K, Voget S,. Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks. European Journal of Operational Research 1997; 103 (3): 610-627.
    • (1997) European Journal of Operational Research , vol.103 , Issue.3 , pp. 610-627
    • Nachtigall, K.1    Voget, S.2
  • 10
    • 18944375494 scopus 로고    scopus 로고
    • Some practical aspects of periodic timetabling
    • Chamoni P. et al. (eds.). Springer: Germany
    • Liebchen C, Peeters L,. Some practical aspects of periodic timetabling. In Operations Research 2001, Chamoni P, et al. (eds.). Springer: Germany, 2002.
    • (2002) Operations Research 2001
    • Liebchen, C.1    Peeters, L.2
  • 11
    • 56249113768 scopus 로고    scopus 로고
    • Integral cycle bases for cyclic timetabling
    • Liebchen C, Peeters L,. Integral cycle bases for cyclic timetabling. Discrete Optimization 2009; 6 (1): 98-109.
    • (2009) Discrete Optimization , vol.6 , Issue.1 , pp. 98-109
    • Liebchen, C.1    Peeters, L.2
  • 14
  • 16
    • 84901411946 scopus 로고    scopus 로고
    • A co-evolutionary algorithm for train timetabling
    • IEEE Press
    • Kwan RSV, Mistry P,. A co-evolutionary algorithm for train timetabling. In IEEE Press, editor, Congress on Evolutionary Computation, 2142-2148, 2003.
    • (2003) Congress on Evolutionary Computation , pp. 2142-2148
    • Kwan, R.S.V.1    Mistry, P.2
  • 17
    • 0036759198 scopus 로고    scopus 로고
    • Modeling and solving the train timetabling problem
    • Caprara A, Fischetti M, Toth P,. Modeling and solving the train timetabling problem. Operations Research 2002; 50 (5): 851-861.
    • (2002) Operations Research , vol.50 , Issue.5 , pp. 851-861
    • Caprara, A.1    Fischetti, M.2    Toth, P.3
  • 18
    • 33644594453 scopus 로고    scopus 로고
    • A lagrangian heuristic algorithm for a real-world train timetabling problem
    • Caprara A, Monaci M, Toth P, Guida P,. A lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics 2006; 154: 738-753.
    • (2006) Discrete Applied Mathematics , vol.154 , pp. 738-753
    • Caprara, A.1    Monaci, M.2    Toth, P.3    Guida, P.4
  • 20
    • 78650812863 scopus 로고    scopus 로고
    • Optimizing the demand captured by a railway system with a regular timetable
    • Cordone R, Redaelli F,. Optimizing the demand captured by a railway system with a regular timetable. Transportation Research Part B 2011; 45: 430-446.
    • (2011) Transportation Research Part B , vol.45 , pp. 430-446
    • Cordone, R.1    Redaelli, F.2
  • 21
    • 33646681684 scopus 로고    scopus 로고
    • Techniques for absolute capacity determination in railways
    • Burdett RL, Kozan E,. Techniques for absolute capacity determination in railways. Transportation Research B 2006; 40: 616-632.
    • (2006) Transportation Research B , vol.40 , pp. 616-632
    • Burdett, R.L.1    Kozan, E.2
  • 23
    • 80053008328 scopus 로고    scopus 로고
    • Operación mixta de una línea de ferrocarril. Análisis de capacidad y gestión de material rodante
    • Canca D,. Operación mixta de una línea de ferrocarril. Análisis de capacidad y gestión de material rodante. Dirección y Organización 2009; 39: 45-53.
    • (2009) Dirección y Organización , vol.39 , pp. 45-53
    • Canca, D.1
  • 27
    • 13544267417 scopus 로고    scopus 로고
    • Bicriteria train scheduling for high-speed passenger railroad planning applications
    • Zhou X, Zhong M,. Bicriteria train scheduling for high-speed passenger railroad planning applications. European Journal of Operational Research 2005; 167 (3): 752-771.
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 752-771
    • Zhou, X.1    Zhong, M.2
  • 29
    • 78650894740 scopus 로고    scopus 로고
    • The methodology of multiple criteria decision making/aiding in public transportation
    • Zak J,. The methodology of multiple criteria decision making/aiding in public transportation. Journal of Advanced Transportation 2011; 45 (1): 1-20.
    • (2011) Journal of Advanced Transportation , vol.45 , Issue.1 , pp. 1-20
    • Zak, J.1
  • 32
    • 33750710227 scopus 로고    scopus 로고
    • An algorithmic framework for convex mixed integer nonlinear programs
    • Bonami P, Biegler LT, Conn AR, et al,. An algorithmic framework for convex mixed integer nonlinear programs. IBM Research Report 2005: RC23771.
    • (2005) IBM Research Report
    • Bonami, P.1    Biegler, L.T.2    Conn, A.R.3
  • 33
    • 29144523061 scopus 로고    scopus 로고
    • On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming
    • Wachter A, Biegler LT,. On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming 2005; 106 (1): 25-57.
    • (2005) Mathematical Programming , vol.106 , Issue.1 , pp. 25-57
    • Wachter, A.1    Biegler, L.T.2
  • 34
    • 84897609824 scopus 로고    scopus 로고
    • Website: COIN-OR. [Accessed March, 12, 2012]
    • Website: COIN-OR. www.coin-or.org. [Accessed March, 12, 2012 ].


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