TECHNICAL PAPERS
Oct 14, 2009

Genetic Algorithm for Bus Frequency Optimization

Publication: Journal of Transportation Engineering
Volume 136, Issue 6

Abstract

In this paper, a bilevel programming model for the bus frequency design is presented, which determines the optimal bus frequencies aiming to minimize the total travel time of passengers subject to the constraint on the overall fleet size of each company by accounting for the route choice behaviors of the users. The objective of the lower level is to assign transit trips to bus route network based on optimal strategy. In the upper level, bus frequencies of routes are optimized as a result of passenger assignment. An iterative approach, which consists of a genetic algorithm and a label-marking method, is used to solve the bilevel model. Finally, the model and the algorithms are illustrated with two test examples. The results show that the optimization can improve the local service level of one company, and the proper integration of several companies probably improves the efficiency of resources and the service level of the whole transit system.

Get full access to this article

View all available purchase options and get full access to this article.

Acknowledgments

This research is financed by the National Science Foundation for Postdoctoral Scientists of China under Grant No. NSF20080440168 and the Doctoral Program Foundation for Young Scholar of Institutions of Higher Education of China through Project No. UNSPECIFIED20070151013.

References

Ben-Akiva, M., and Lerman, S. R. (1985). Discrete choice analysis: theory and application to travel demand, MIT Press, Cambridge, Mass.
Ceder, A. (1984). “Bus frequency determination using passenger count data.” Transportation Research-A, 18, 439–453.
Chakroborty, P. (2003). “Genetic algorithms for optimal urban transit network design.” Comput. Aided Civ. Infrastruct. Eng., 18, 184–200.
Chakroborty, P., Deb, K., and Sharma, R. K. (2001). “Optimal fleet size distribution and scheduling of urban transit systems using genetic algorithms.” Transp. Plan. Technol., 24(3), 209–225.
Chakroborty, P., Deb, K., and Subrahmanyam, P. S. (1995). “Optimal scheduling of urban transit systems using genetic algorithms.” J. Transp. Eng., 121(6), 544–553.
Chen, H. F. (2007). “Stochastic optimization in computing multiple headways for a single bus line.” J. Chinese Institute of Industrial Engineers, 24(5), 351–359.
Furth, P. G., and Wilson, N. H. M. (1982). “Setting frequencies on bus routes: Theory and practice.” Transp. Res. Rec., 818, 1–7.
Gao, Z. Y., Sun, H. J., and Shan, L. L. (2004). “A continuous equilibrium network design model and algorithm for transit systems.” Transp. Res., Part B: Methodol., 38, 235–250.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning, Addison-Wesley, Reading, Mass.
Han, A. F., and Wilson, N. H. M. (1982). “The allocation of buses in heavily utilized networks with overlapping routes.” Transp. Res., Part B: Methodol., 16(3), 221–232.
Holland, J. H. (1975). Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, Mich.
Park, S. J. (2005). “Bus network scheduling with genetic algorithms and simulation.” MS thesis, Univ. of Maryland.
Schéele, S. (1980). “A supply model for public transit services.” Transp. Res., Part B: Methodol., 14, 133–146.
Shih, M. C., and Mahmassani, H. S. (1995). “Vehicle sizing model for bus transit networks.” Transp. Res. Rec., 1452, 35–41.
Spiess, H., and Florian, M. (1989). “Optimal strategies: A new assignment model for transit networks.” Transp. Res., Part B: Methodol., 23(2), 83–102.
Tom, V. M., and Mohan, S. (2003). “Transit route network design using frequency coded genetic algorithm.” J. Transp. Eng., 129(2), 186–195.
Yan, S., Chen, C. J., and Tang, C. H. (2006). “Inter-city bus routing and timetable setting under stochastic demands.” Transp. Res., Part A, 40, 572–586.
Yan, S., and Tang, C. (2008). “An integrated framework for intercity bus scheduling under stochastic bus travel times.” Transp. Sci., 42(3), 318–335.
Yang, Z. Z., Yu, B., and Cheng, C. T. (2007). “A parallel ant colony algorithm for bus network optimization.” Comput. Aided Civ. Infrastruct. Eng., 22(1), 44–55.
Yu, B., and Yang, Z. -Z. (2007). “A dynamic holding strategy in public transit systems with real-time information.” Appl. Intell., 31(1), 69–80.
Yu, B., Yang, Z. -Z., and Cheng, C. -T. (2007). “Optimizing the distribution of shopping centers with parallel genetic algorithm.” Eng. Applic. Artif. Intell., 20(2), 215–223.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering
Journal of Transportation Engineering
Volume 136Issue 6June 2010
Pages: 576 - 583

History

Received: Oct 30, 2008
Accepted: Oct 12, 2009
Published online: Oct 14, 2009
Published in print: Jun 2010

Permissions

Request permissions for this article.

Authors

Affiliations

Transportation Management College, Dalian Maritime Univ., Dalian 116026, People’s Republic of China. E-mail: [email protected]
Zhongzhen Yang [email protected]
Transportation Management College, Dalian Maritime Univ., Dalian 116026, People’s Republic of China (corresponding author). E-mail: [email protected]
School of Civil Engineering and Architecture, Beijing Jiaotong Univ., Beijing 100044, People’s Republic of China. E-mail: [email protected]

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.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share