Use of a Hybrid Algorithm for Modeling Coordinated Feeder Bus Route Network at Suburban Railway Station
Publication: Journal of Transportation Engineering
Volume 135, Issue 1
Abstract
In the metropolitan cities of developed and developing countries, longer journeys are mostly performed by two or more modes. In the event of availability of suburban trains and public buses, commuters prefer to travel a longer stretch of their journeys by train, so as to avoid traffic congestion on roads, and the remaining part by buses to reach local areas if their final destination is not in close proximity to railway stations. Normally suburban trains have fixed corridors and buses have the flexibility to serve remote local areas. Thus design of feeder routes from railway stations to various destinations and the transfer time from trains to buses plays a very important role and can be controlled by transport planners. A considerable amount of research has been done on the independent design of a bus route network without considering the effect of train services. Researchers have made attempts using heuristics, simulation, expert systems, artificial intelligence, and optimization techniques for design of routes and schedules. So far, limited effort has been made in modeling coordinated operations. In this research, a new hybrid algorithm which exploits the benefits of genetic algorithms and a well tested heuristic algorithm for the study area is discussed. More convincing results in terms of feeder routes and coordinated schedules at the selected railway station are obtained by the proposed hybrid algorithm as compared to earlier approaches adopted by the writers for the same study area.
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. (1995). “Hybrid route generation heuristic algorithm for the design of transit networks.” Transp. Res., Part C: Emerg. Technol., 3(1), 31–50.
Chambers, L. (1995). Practical handbook of genetic algorithms applications, Vol. I, CRC Press, Boca Raton, Fla.
Eppstein, D. (1994). “Finding the shortest paths.” Tech. Rept. No. 94-26, Dept. of Information and Computer Science, Univ. of California, ⟨http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-26.pdf⟩ (Sept. 25, 2004).
Geok, K., and Perl, J. (1988). “Optimization of feeder bus routes and bus stop spacing.” J. Transp. Eng., 114(3), 341–354.
Reklaitis, G. V., Ravindran, A., and Ragsdell, K. M. (1983). Engineering optimization—Methods and applications, Wiley, New York.
Shrivastava, P., and Dhingra, S. L. (2000). “An overview of bus routing and scheduling techniques.” Highway Research Bulletin No. 62, 65–90.
Shrivastava, P., and Dhingra, S. L. (2001). “Development of feeder routes for suburban railway stations using heuristic approach.” J. Transp. Eng., 127(4), 334–341 (2001).
Shrivastava, P., Dhingra, S. L., and Gundaliya, P. J. (2002). “Application of genetic algorithm for scheduling and schedule co-ordination problems.” J. Adv. Transp., 36(1), 23–41.
Shrivastava, P., and O’Mahony, M. (2006). “A model for development of optimized feeder routes and coordinated schedules—A genetic algorithms approach.” Transp. Policy, 13(5), 413–425.
Shrivastava, P., and O’Mahony, M. (2007). “Design of feeder route network using combined genetic algorithm and specialized repair heuristic.” Journal of Public Transportation, 10(2), 99–123.
Wilson, S. (2000). “Final report on bus network strategy appraisal report for greater Dublin area.” ⟨www.dublinbus.ie/about_us-pdf/swilson.pdf⟩ (May 13, 2004).
Wirasinghe, S. C. (1980). “Nearly optimal parameters for a rail feeder bus system on a rectangular grid.” Transp. Sci., 14A(1), 33–40.
Zhao, F., and Ubaka, I. (2004). “Transit network optimization—Minimizing transfers and optimizing route directness.” Journal of Public Transportation, 7, 67–82.
Information & Authors
Information
Published In
Copyright
© 2009 ASCE.
History
Received: Jul 29, 2005
Accepted: Jun 6, 2008
Published online: Jan 1, 2009
Published in print: Jan 2009
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.