Feeder Bus Routes Generation within Integrated Mass Transit Planning Framework
Publication: Journal of Transportation Engineering
Volume 131, Issue 11
Abstract
This paper discusses a model for developing optimal feeder bus routes, within integrated mass transit planning framework, for urban rail transit stations. The model is a part of the methodology to develop an effective and efficient integrated urban mass transit system for a city which has a potential demand for a new rail-based mass transit system besides the street transit system and existing rail-based system (if any). In addition to the proposed model the methodology consists of rail transit corridor identification and integrated scheduling models, but they are not within the scope of this paper. The routes are generated in two levels; the first level generates the initial set of shortest paths (potential feeder routes) based on the maximum and minimum route length criteria, and in the second level, a search is made around these corridors by generating shortest paths for each station-to-terminal node pair (potential feeder route) and using genetic algorithm to select one route combination out of all possible routing configurations. The feeder routes were developed for two different cases: Case 1 for selective search and Case 2 for open search, and the best results out of the two were adopted. Thane City, which is a part of Mumbai Metropolitan Region, India, is taken as the case study area. It was found that better results in terms of minimized objective function value were obtained for the open search case. The proposed model is able to develop optimal feeder routes, within integrated mass transit planning framework.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The writers would like to thank Maharashtra State Road Development Corporation (MSRDC) and M/s Consulting Engineering Services (I) Ltd., for providing all the necessary data for this study. They also express their gratitude to Mr. Pradip J. Gundaliya for his valuable help in running the LibGA software.
References
Bajj, M. H., and Mahamassani, H. S. (1990). “TRUST: A LISP program for analysis of transit route configurations.” Transportation Research Record 1283, Transportation Research Board, Washington, D.C., 125–135
Bajj, M. H., and Mahamassani, H. S. (1995). “Hybrid route generation heuristic algorithm for the design of transit networks.” Transp. Res., Part C: Emerg. Technol., 3(1), 31–50.
Chien, S., and Schonfeld, P. (1998). “Joint optimization of a rail transit line and its feeder bus system.” J. Adv. Transp., 32(3), 253–284.
Chien, S., Yang, Z., and Hou, E. (2001). “Genetic algorithm approach for transit route planning and design.” J. Transp. Eng., 127(3), 200–207.
Consulting Engineering Services India Ltd., (CES)., (2001). “Proposed mass rapid transit system for Thane City.” Draft Final Rep., MSRDC, Mumbai, India.
Corcoran, A. L., and Wainwright, R. L. (1994). “LibGA: A user friendly work bench for ordered based genetic algorithm research.” Proc., 1993 ACM/SIGAPP Symp. on Applied Computing, E. Deaton, K. M. George, H. Berghel, and G. Hedrick, eds., ACM, New York, 111–118.
Deb, K. (1995). Optimization for engineering design: Algorithms and examples, Prentice-Hall, New Delhi, India.
Dhingra, S. L. (1980). “Simulation of routing and scheduling of city bus transit network.” PhD thesis, Indian Institute of Technology, Kanpur, India.
Dubosis, D., Bel, G., and Llibre, M. (1979). “A set of methods in transportation network synthesis and analysis.” Oper. Res., 30(9), 797–808.
Goldberg, D. E. (1989). Genetic algorithm in search, optimization, and machine learning, Addison-Wesley, Reading, Mass.
Goldberg, D. E., and Deb, K. (1991). “A comparative analysis of selection schemes used in genetic algorithms.” Foundations of genetic algorithms, G. J. E. Rawing, ed., 69–93.
Holland, J. H. (1975). Adaptation in natural and artificial systems, University of Michigan, Ann Arbor, Mich.
Hsu, J., and Surti, V. H. (1976). “Demand model for bus network design.” Transp. Eng. J. ASCE, 102(3), 451–460.
Lampkin, W., and Salmans, P. D. (1967). “The design of routes, service frequencies and schedules for a municipal bus undertaking: A case study.” Oper. Res. Q., 18(4), 375–397.
Mandl, C. E. (1980). “Evaluation and optimization of urban public transport networks.” Eur. J. Oper. Res., 6, 31–56.
Shier, D. R. (1979). “On algorithms for finding the K shortest paths in a network.” Network, 9, 195–214.
Shrivastava, P. (2001). “Modeling for coordinated bus route network of suburban railway corridors.” PhD thesis, IIT, Bombay, India.
Silman, L. A., Brazily, Z., and Passy, U., (1974). “Planning the route system for urban buses.” Comput. Oper. Res., 1, 201–211.
Verma, A. (2004). “Modelling for an integrated urban mass transit system.” PhD thesis, Indian Institute of Technology, Bombay, India.
Information & Authors
Information
Published In
Copyright
© 2005 ASCE.
History
Received: Feb 5, 2004
Accepted: Mar 29, 2005
Published online: Nov 1, 2005
Published in print: Nov 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.