Access the full text.
Sign up today, get DeepDyve free for 14 days.
O. Nielsen (2000)
A Stochastic Traffic Assignment Model Considering Differences in Passengers Utility Functions
J. Bard (1998)
Practical Bilevel Optimization
H. Lo, C. Yip, K. Wan (2003)
Modeling transfer and non-linear fare structure in multi-modal networkTransportation Research Part B-methodological, 37
J. Rea (1971)
Designing urban transit systems : an approach to the route-technology selection problemHighway Research Record
A. Ceder, N. Wilson (1986)
Bus network designTransportation Research Part B-methodological, 20
J. Bard (1998)
Practical Bilevel Optimization: Algorithms and Applications
G. Bruno, G. Ghiani, G. Improta (1998)
A multi-modal approach to the location of a rapid transit lineEuropean Journal of Operational Research, 104
H. Dufourd, M. Gendreau, G. Laporte (1996)
LOCATING A TRANSIT LINE USING TABU SEARCHLocation Science, 4
H. Lo, C. Yip, Q. Wan (2004)
Modeling competitive multi-modal transit services; a nested logit approach.Transportation Research Part C-emerging Technologies, 12
M. Baaj, H. Mahmassani (1995)
Hybrid route generation heuristic algorithm for the design of transit networksTransportation Research Part C-emerging Technologies, 3
H. Lo, C. Yip, Q. Wan (2002)
Modeling Competitive Multi-modal Transit Services
S. Pattnaik, S. Mohan, V. Tom (1998)
Urban Bus Transit Route Network Design Using Genetic AlgorithmJournal of Transportation Engineering-asce, 124
B. Colson, P. Marcotte, G. Savard (2005)
Bilevel programming: A survey4OR, 3
M. Ben-Akiva, S. Lerman (1985)
Discrete Choice Analysis: Theory and Application to Travel Demand
HK Lo, CW Yip, QK Wan (2003)
Advanced modeling for transit operations and service planning
T. Magnanti, R. Wong (1984)
Network Design and Transportation Planning: Models and AlgorithmsTransp. Sci., 18
A Mas-Colell, MD Whinston, JR Green (1995)
Microeconomic theory
Mathias Michaelis, A. Schöbel (2009)
Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristicPublic Transport, 1
Q. Wan, H. Lo (2003)
A Mixed Integer Formulation for Multiple-Route Transit Network DesignJournal of Mathematical Modelling and Algorithms, 2
The planning of transit services is vital to transit-oriented metropolises. It is a complex, multi-objective decision process, especially for services operated by the private sector. Traveler’s desire for direct, affordable, and quality services often conflicts with the profit-making objective of private operators. In a multi-modal network, partly collaborative and partly competitive interactions among transit modes further complicate the problem. To simplify the planning problem, existing studies generally consider transit network design from the perspective of a single mode while neglecting the modal interactions. The lack of a comprehensive approach across transit modes may result in an unbalanced supply of transit services, weakening the financial viability of the services and, more importantly, adding unnecessarily to congestion, especially in already congested districts. This study explicitly considers these interactions in a multi-modal network framework. We develop a systematic phase-wise methodology for multi-modal network design, considering both the effect of congestion and integration of modal transfers. Inter-route and inter-modal transfers are modeled through the State Augmented Multi-modal (SAM) network approach developed in earlier studies. An illustrative example is included to demonstrate the design procedure and its salient features.
Public Transport – Springer Journals
Published: Nov 5, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.