Congested multimodal transit network design

Public Transport

Volumn 1, Issue 3, 2009, Pages 233-251

  Wan, Quentin K ^a   Lo, Hong K ^b  

^a EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN;

COMPETITIVE INTERACTIONS; FINANCIAL VIABILITY; MODAL INTERACTIONS; MULTI-MODAL TRANSIT NETWORKS; MULTIMODAL NETWORK; MULTIOBJECTIVE DECISION; TRANSIT NETWORK DESIGN; UNBALANCED SUPPLIES;

MASS TRANSPORTATION;

EID: 79952929539     PISSN: 1866749X     EISSN: 16137159     Source Type: Journal    
DOI: 10.1007/s12469-009-0015-8     Document Type: Article

References (17)

1. Baaj MH, Mahmassani HS (1995) Hybrid route generation heuristic algorithm for the design of transit networks. Transp Res Part C 3: 31-50.
2. Bard JF (1998) Practical bilevel optimization: algorithms and applications. Kluwer Academic, Dordrecht.
3. Ben-Akiva M, Lerman SR (1985) Discrete choice analysis: theory and application to travel demand. MIT Press, Cambridge.
4. Bruno G, Ghiani G, Improt G (1998) A multi-modal approach to the location of a rapid transit line. Eur J Oper Res 104: 321-332.
5. Ceder A, Wilson NHM (1986) Bus network design. Transp Res Part B 20: 331-344.
6. Colson B, Marcotte P, Savard G (2005) Bilevel programming: a survey. Q J Oper Res 3: 87-107.
7. Dufourd H, Gendreau M, Laporte G (1996) Locating a transit line using tabu search. Locat Sci 4: 1-19.
8. Lo HK, Yip CW, Wan KH (2003a) Modeling transfer and nonlinear fare structure in multi-modal network. Transp Res Part B 37: 149-170.
9. Lo HK, Yip CW, Wan QK (2003b) Modeling competitive multi-modal transit services. In: Lam WHK, Bell MGH (eds) Advanced modeling for transit operations and service planning. Pergamon, Amsterdam, pp 231-256.
10. Lo HK, Yip CW, Wan QK (2004) Modeling competitive multi-modal transit services: a nested logit approach. Transp Res Part C 12: 251-272.
11. Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18: 1-55.
12. Mas-Colell A, Whinston MD, Green JR (1995) Microeconomic theory. Oxford University Press, New York.
13. Michaelis M, Schöbel A (2009, to appear) Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristic. Public Transp. doi: 10. 1007/s12469-009-0014-9.
14. Nielsen OA (2000) A stochastic transit assignment model considering differences in passengers utility functions. Transp Res Part B 34: 377-402.
15. Pattnaik SB, Mohan S, Tom VM (1998) Urban bus transit route network design using genetic algorithm. J Transp Eng 124: 368-375.
16. Rea JC (1971) Designing urban transit systems: An approach to the route-technology selection problem. Report no. UMTA-URT-49(70)-71-6 by the Urban Transportation Program, University of Washington, Seattle, WA.
17. Wan QK, Lo HK (2003) A mixed integer formulation for multiple-route transit network design. J Math Model Algorithms 2: 299-308.