메뉴 건너뛰기




Volumn 45, Issue 1, 2011, Pages 54-65

Designing robust rapid transit networks with alternative routes

Author keywords

Network design; Rapid transit systems; Robustness

Indexed keywords

ALTERNATIVE ROUTES; COMPUTATIONAL EXPERIMENT; FLOW CONDITION; NETWORK DESIGN; ORIGIN-DESTINATION PAIRS; RAPID TRANSIT SYSTEMS; ROBUSTNESS; TRANSIT NETWORKS;

EID: 78650860682     PISSN: 01976729     EISSN: 20423195     Source Type: Journal    
DOI: 10.1002/atr.132     Document Type: Article
Times cited : (63)

References (34)
  • 9
    • 0036449201 scopus 로고    scopus 로고
    • Parking capacity and pricing in park'n ride trips: A continuous equilibrium network design problem
    • García R, Marín A,. Parking capacity and pricing in park'n ride trips: a continuous equilibrium network design problem. Annals of Operations Research 2002; 116: 153-178.
    • (2002) Annals of Operations Research , vol.116 , pp. 153-178
    • García, R.1    Marín, A.2
  • 10
    • 49949095366 scopus 로고    scopus 로고
    • An integrated methodology for the rapid transit network design problem. Lecture Notes in Computer Science
    • Laporte G, Marín A, Mesa JA, Ortega FA,. An integrated methodology for the rapid transit network design problem. Lecture Notes in Computer Science. Algorithmic Methods for Railway Optimization 2007; 4359: 187-199.
    • (2007) Algorithmic Methods for Railway Optimization , vol.4359 , pp. 187-199
    • Laporte, G.1    Marín, A.2    Mesa, J.A.3    Ortega, F.A.4
  • 11
    • 55749103574 scopus 로고    scopus 로고
    • An extension to rapid transit network design problem
    • Marín A,. An extension to rapid transit network design problem. TOP 2007; 15: 231-241.
    • (2007) TOP , vol.15 , pp. 231-241
    • Marín, A.1
  • 13
    • 28244502056 scopus 로고    scopus 로고
    • Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
    • Fortz B, Mahjoub AR, McCormick ST, Pesneau P,. Two-edge connected subgraphs with bounded rings: polyhedral results and branch-and-cut. Mathematical Programming 2006; 105: 85-111.
    • (2006) Mathematical Programming , vol.105 , pp. 85-111
    • Fortz, B.1    Mahjoub, A.R.2    McCormick, S.T.3    Pesneau, P.4
  • 14
    • 0029407103 scopus 로고
    • Polyhedral and computational investigations for designing communication networks with high survivability requirements
    • Grötschel M, Monma CL, Stoer M,. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Operations Research 1995; 43: 1012-1024.
    • (1995) Operations Research , vol.43 , pp. 1012-1024
    • Grötschel, M.1    Monma, C.L.2    Stoer, M.3
  • 15
    • 71049191339 scopus 로고    scopus 로고
    • A robust approach to discrete network designs with demand uncertainty. Transportation Research Record
    • Lou Y, Yin Y, Lawphongpanich S,. A robust approach to discrete network designs with demand uncertainty. Transportation Research Record: Journal of the Transportation Research Board 2009; 2090: 86-94.
    • (2009) Journal of the Transportation Research Board , vol.2090 , pp. 86-94
    • Lou, Y.1    Yin, Y.2    Lawphongpanich, S.3
  • 16
    • 52749084307 scopus 로고    scopus 로고
    • A robust approach to continuous network designs with demand uncertainty
    • Allsop R.E., Bell M.G.H., Heydecker B.G. (eds). Elsevier: Amsterdam
    • Yin Y, Lawphongpanich S,. A robust approach to continuous network designs with demand uncertainty. In Transportation and Traffic Theory, Allsop RE, Bell MGH, Heydecker BG, (eds). Elsevier: Amsterdam, 2007; 111-126.
    • (2007) Transportation and Traffic Theory , pp. 111-126
    • Yin, Y.1    Lawphongpanich, S.2
  • 17
    • 0037401572 scopus 로고    scopus 로고
    • Network with degradable links: Capacity analysis and design
    • Lo HK, Tung Y-K,. Network with degradable links: capacity analysis and design. Transportation Research Part B 2003; 37: 345-363.
    • (2003) Transportation Research Part B , vol.37 , pp. 345-363
    • Lo, H.K.1    Tung, Y.-K.2
  • 18
    • 0031829844 scopus 로고    scopus 로고
    • Models and algorithms to road network design: A review and some new developments
    • Yang H, Bell MGH,. Models and algorithms to road network design: a review and some new developments. Transport Reviews 1998; 18: 257-278.
    • (1998) Transport Reviews , vol.18 , pp. 257-278
    • Yang, H.1    Bell, M.G.H.2
  • 19
    • 0000514655 scopus 로고
    • Scenarios and policy aggregation in optimization under uncertainty
    • Rockafellar RT, Wets RJ-B,. Scenarios and policy aggregation in optimization under uncertainty. Mathematics of Operation Research 1991; 16: 119-147.
    • (1991) Mathematics of Operation Research , vol.16 , pp. 119-147
    • Rockafellar, R.T.1    Wets, R.-B.2
  • 24
    • 0141712989 scopus 로고    scopus 로고
    • Robust optimization - Methodology and applications
    • Ben-Tal A, Nemirovski A,. Robust optimization-methodology and applications. Mathematical Programming 1999; 92: 453-480.
    • (1999) Mathematical Programming , vol.92 , pp. 453-480
    • Ben-Tal, A.1    Nemirovski, A.2
  • 25
    • 84870613023 scopus 로고    scopus 로고
    • Robust discrete optimization and network flows
    • Bertsimas D, Sim M,. Robust discrete optimization and network flows. Mathematical Programming 2003; 98: 49-71.
    • (2003) Mathematical Programming , vol.98 , pp. 49-71
    • Bertsimas, D.1    Sim, M.2
  • 30
    • 64149118033 scopus 로고    scopus 로고
    • Urban rapid transit network design: Accelerated benders decomposition
    • Marín A, Jaramillo P,. Urban rapid transit network design: accelerated benders decomposition. To appear in Annals of Operations Research 2009; 169: 35-53.
    • (2009) To Appear in Annals of Operations Research , vol.169 , pp. 35-53
    • Marín, A.1    Jaramillo, P.2


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