Traffic Modeling and College-Bus Routing Using Entropy Maximization
Publication: Journal of Transportation Engineering
Volume 136, Issue 2
Abstract
A method is presented by which traffic flow estimation between known origins and destinations can be evaluated based on a modified entropy model, and by which bus-routing optimization can be performed. The traffic flow analysis is performed by use of an entropy-based formulation of the vehicular movements of students within the domain under examination, while the perceived level of disorder caused by the numerous vehicle-student-trips in the domain under examination is subsequently used for the formulation of a policy and a bus-routing scheme in order to minimize the original entropy in the system. The entropy metric used in the scheduling optimization is related to the probability of student-trips by origin and destination, and an application of the method is illustrated via a case study of an urban university (with facilities in multiple locations) initiating bus service for its students.
Get full access to this article
View all available purchase options and get full access to this article.
References
Agrawal, A. K., Mohan, D., and Singh, R. S. (2005). “Traffic planning in a constrained network using entropy maximisation approach.” J. Inst. Eng. (India), Part AG, 85, 236–240.
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.
Baker, B. M., and Ayechew, M. A. (2003). “A genetic algorithm for the vehicle routing problem.” Comput. Oper. Res., 30(5), 787–800.
Bowerman, R., Hall, B., and Calamai, P. (1995). “A multi-objective optimization approach to urban school bus routing: Formulation and solution method.” Transp. Res., Part A: Policy Pract., 29, 107–123.
Braca, J., Bramel, J., Posner, B., and Simchi-Levi, D. (1997). “A computerized approach to the New York city school bus routing problem.” IIE Trans., 29, 693–702.
Chandler, R. E., Herman, R., and Montroll, E. W. (1958). “Traffic dynamics: Studies in car following.” Oper. Res., 6, 165–184.
Chien, S., Yang, Z., and Hou, E. (2001). “Genetic algorithm approach for transit route planning and design.” J. Transp. Eng., 127(3), 200–207.
Creput, J., and Koukam, A. (2007). “Interactive meshing for the design and optimization of bus transportation networks.” J. Transp. Eng., 133(9), 529–538.
Das, N. C., Chakrabarti, C. G., and Mazumder, S. K. (2000). “Traffic network and distribution of cars: Maximum-entropy approach.” J. Transp. Eng., 126(1), 89–92.
Fan, W., and Machemehl, R. B. (2006). “Optimal transit route network design problem with variable transit demand: Genetic algorithm approach.” J. Transp. Eng., 132(1), 40–51.
Levinson, D., and Kumar, A. (1994). “A multi-modal trip distribution model.” Transp. Res. Rec., 1466, 124–131.
Li, L. Y. O., and Fu, Z. (2002). “The school bus routing problem: A case study.” J. Oper. Res. Soc., 53(5), 552–558.
Li, Y, Ziliaskopoulos, T., and Boyce, D. (2002). “Combined model for time-dependent trip distribution and traffic assignment.” Transp. Res. Rec., 1783(1), 98–109.
Mirchandani, P. B. and Head, K. L. (2000). “Model-based transportation policy analysis.” Int. J. Technol. Manage., 19(3), 507–531.
Roess, R. P., Prassas, E. S., and McShane, W. R. (2004). Traffic Engineering, 3rd Ed., Prentice-Hall, Upper Saddle River, N.J.
Samanta, B., and Roy, T. K. (2005). “Multiobjective entropy transportation model with trapezoidal fuzzy number penalties, sources, and destinations.” J. Transp. Eng., 131(6), 419–428.
Steenbrink, P. A. (1974). Optimization of transport networks, Wiley, New York.
Thangiah, S. R., and Nygard, K. E. (2005). School bus routing using genetic algorithms, Vol. 1707, SPIE, Applications of Artificial Intelligence, Orlando, Fla., 387–395.
Tomlin, S. G. (1979). “A kinetic theory of urban dynamics.” Envir. Plan. A, 11, 97–106.
Wang, D. H., Yao, R. H., and Jing, C. (2006). “Entropy models of trip distribution.” J. Urban Plng. Dev., 132(1), 29–35.
Wilson, A. G. (1970a). Entropy in urban and regional planning, Pion, London.
Wilson, A. G. (1970b). “The use of the concept of entropy in system modeling.” Oper. Res. Q., 21(2), 247–265.
Yan, S., and Chen, H. L. (2002). “A scheduling model and a solution algorithm for inter-city bus carriers.” Transp. Res., Part A: Policy Pract., 36(9), 805–825.
Yan, S., Chi, C. J., and Tang, C. H. (2006). “Inter-city bus routing and timetable setting under stochastic demands.” Transp. Res., Part A: Policy Pract., 40(7), 572–586.
Zhao, F. and Ubaka, I. (2004). “Transit network optimization—Minimizing transfers and optimizing route directness.” J. Public Transportation, 7(1), 63–82.
Ziliaskopoulos, A. K., and Mahmassani, H. S. (1993). “Time-dependent, shortest-path algorithm for realtime intelligent vehicle highway system applications.” Transp. Res. Rec., 1408, 94–100.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 136 • Issue 2 • February 2010
Pages: 102 - 109
Copyright
© 2010 ASCE.
History
Received: Aug 11, 2008
Accepted: May 8, 2009
Published online: May 11, 2009
Published in print: Feb 2010
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.