Transit Network Design with Variable Demand
Publication: Journal of Transportation Engineering
Volume 131, Issue 1
Abstract
This paper shows the iterative approach to solving transit network design problem, particularly with variable transit demand under a given fixed total demand. Although recent studies, which use a simplified combinatorial search approach, showed their capability of building optimal transit networks and handling the complicated transit travel time characteristics, only this iterative approach is believed to properly handle the dynamic characteristics of the relationship between variable transit trip demand and optimal transit network design. Since transit demand depends on the configuration of the transit network and frequencies of the routes, this approach is more desirable for transit network planning than combinatorial approach. The basic approach generates the optimal transit network from the initial network, which requires the shortest in-vehicle travel time, through iterating the assignment procedure and the improvement procedure until there is no more improvement in the network. With variable transit demand, the modal split procedure is added to the basic model to generate the optimal transit network and to estimate transit demand simultaneously. This paper also shows the relationship between optimal transit network design and critical design inputs, such as transit operating speed, total demand size, and transfer penalty. As results of the analysis, synergistic effect of variable transit demand and the optimal transit network are discussed.
Get full access to this article
View all available purchase options and get full access to this article.
References
Baaj, M. H., and Mahmassani, H. S. (1991). “An AI-based approach for transit route system planning and design.” J. Adv. Transp., 25(2), 187–210.
Cedar, A., and Israeli, Y. (1998). “User and operator perspective in transit network design.” Proc. 77th Annual Meeting of TRB, Paper No. 980267, Washington, D.C., January.
Chien, S., Yang, Z., and Hou, E. (2001). “Genetic algorithm approach for transit route planning and design.” J. Transp. Eng., 127(3), 200–207.
Dantzig, G. B. (1966). “All Shortest Routes in a Graph.” Proc., Int. Symp. Théorie des Graphes, Rome, Dunod, Paris, 91–92.
Dijkstra, E. W. (1959). “A note on two problems in connection with graphs.” Numer. Math., 1, 269–271.
Federal Highway Administration and Urban Mass Transportation Administration (FHWA/UMTA). (1977). An introduction to urban travel demand forecasting: A self-instructional text, United States Department of Transportation, Washington, D.C.
Hasselström, D. (1981). “Public transportation planning.” PhD dissertation, Univ. of Gothenburg, Gothenburg, Sweden.
Khisty, C. J., and Lall, B. K. (1998). Transportation engineering: An introduction, 2nd Ed., Prentice-Hall, Upper Saddle River, N.J.
Lee, Y. -J. (1998). “Analysis and optimization of transit network design with integrated routing and scheduling.” PhD dissertation, Univ. of Pennsylvania, Philadelphia.
Mandle, C. E. (1979). “Evaluation and optimization of urban transportation networks.” Proc., presented at the 3rd European Congress on Operations Research, Amsterdam, The Netherlands.
Newell, G. F. (1979). “Some issues relating to the optimal design of bus routes.” Transp. Sci., 13(1), 20–35.
Pattnaik, S. B., Mohan, S., and Tom, V. M. (1998). “Urban bus transit network design using genetic algorithm.” J. Transp. Eng., 124(4), 368–375.
Rea, J. C. (1971). “Designing urban transit systems: An approach to the route-technology selection problem.” No. UMTA-URT-49(70)-71-6, Urban Transportation Program, Univ. of Washington, Seattle.
Shih, M., Mahmassani, H. S., and Baaj, M. H. (1998). “A planning and design model for transit route networks with coordinated operations.” Proc., 77th Annual Meeting of TRB, Paper No. 980418, Washington, D.C.
Vuchic, V. R., et al. (1976). Transit operating manual, Pennsylvania Department of Transportation, Univ. of Pennsylvania, University Park, Pa.
Whiting, P. D., and Hillier, J. A. (1960). “A method for finding the shortest route through a road network.” Oper. Res. Q., 11, 37–40.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 131 • Issue 1 • January 2005
Pages: 1 - 10
Copyright
© 2004 ASCE.
History
Received: Sep 10, 2002
Accepted: Apr 13, 2004
Published online: Jan 1, 2005
Published in print: Jan 2005
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.