Technical Papers
Nov 3, 2012

Approximate Solution Procedure for Dynamic Traffic Assignment

Publication: Journal of Transportation Engineering
Volume 139, Issue 8

Abstract

This paper proposes an approximate dynamic traffic assignment algorithm for the analysis of traffic conditions in large-scale road networks over several days. The time-dependent origin-destination trips are assumed to be known. A case study for evacuation of the New Orleans metropolitan area prior to the landfall of Hurricane Katrina is presented to test the efficiency and effectiveness of the proposed procedure. The model results are compared to the traffic counts collected during the evacuation and then further tested by the mesoscopic simulation-based model, DynusT. The study shows that the traffic pattern produced by the proposed procedure is a good approximation to traffic count data and that the algorithm provides a good approximation to the computations performed by DynusT.

Get full access to this article

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

Acknowledgments

This work has been funded by the National Science Foundation under grant No. SES-0826832. The authors gratefully acknowledge the continuing support and data provided by the Louisiana Department of Transportation and Development.

References

Ben-Akiva, M., Koutsopoulos, H. N., and Mishalani, R. (1998). “DynaMIT: A simulation-based system for traffic prediction.” Proc., DACCORD Short Term Forecasting Workshop, Delft, Netherlands.
Boyce, D. E., Ran, B., and Leblanc, L. J. (1995). “Solving an instantaneous dynamic user-optimal route choice model.” Transp. Sci., 29(2), 128–142.
Carey, M., and Subrahmanian, E. (2000). “An approach to modelling time-varying flows on congested networks.” Transp. Res. Part B, 34(3), 157–183.
Chen, H. K., and Hsueh, C. F. (1998). “A model and an algorithm for the dynamic user-optimal route choice problem.” Transp. Res. Part B, 32(3), 219–234.
Chiu, Y., Zheng, H., Villalobos, J. A., Peacock, W., and Henk, R. (2008). “Evaluating regional contra-flow and phased evacuation strategies for Texas using a large-scale dynamic traffic simulation and assignment approach.” J. Homeland Secur. Emergency Manage., 5(1), Article 34.
Chiu, Y.-C. (2010). “DynusT user’s manual.” 〈http://dynust.net/wikibin/doku.php〉 (May 15, 2013).
Chiu, Y.-C., Zheng, H., Villalobos, J., and Gautam, B. (2007). “Modeling no-notice mass evacuation using a dynamic traffic flow optimization model.” IIE Trans., 39(1), 83–94.
Chiu, Y.-C., Zhou, L., and Song, H. (2010). “Development and calibration of the anisotropic mesoscopic simulation model for uninterrupted flow facilities.” Transp. Res. Part B, 44(1), 152–174.
Daganzo, C. F. (1994). “The cell transmission model. Part I: A simple dynamic representation of highway traffic.”, Institute of Transportation Studies, Univ. of California, Berkeley, CA.
Daganzo, C. F. (1995). “The cell transmission model. Part II: Network traffic.” Transp. Res. Part B, 29(2), 79–93.
Franzese, O., and Sorensen, J. (2004). “Fast deployable system for consequence management: The emergency evacuation component.” Emergency Management Center at Oak Ridge National Laboratory, 〈http://orise.orau.gov/csepp/documents/planning/evacuation-documents/ evacuation-models/ITS-evac-paper.pdf〉 (May 22, 2013).
Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L., and Wie, B. W. (1993). “A variational inequality formulation of the dynamic network user equilibrium problem.” Oper. Res., 41(1), 179–191.
Friesz, T. L., Luque, J., Tobin, R. L., and Wie, B. W. (1989). “Dynamic network traffic assignment considered as a continuous time optimal control problem.” Oper. Res., 37(6), 893–901.
Han, S. (2003). “Dynamic traffic modeling and dynamic stochastic user equilibrium assignment for general road networks.” Transp. Res. Part B, 37(3), 225–249.
Hobeika, A. G., and Jamei, B. (1985). “MASSVAC: A model for calculating evacuation times under natural disasters.” Emerg. Plann. Simul. Series, 15(1), 23–28.
Hobeika, A. G., and Kim, C. (1998). “Comparison of traffic assignments in evacuation modeling.” IEEE Trans. Eng. Manage., 45(2), 192–198.
Janson, B. N. (1991). “Dynamic traffic assignment for urban road networks.” Transp. Res. Part B, 25(2–3), 143–161.
Janson, B. N., and Robles, J. (1995). “A quasi-continuous dynamic traffic assignment model.” Transportation Research Record 1493, Transportation Research Board, Washington, DC.
Jayakrishman, R., Mahmassani, H. S., and Hu, T.-Y. (1994). “An evaluation tool for advanced traffic information and management systems in urban networks.” Transp. Res. Part C, 2(3), 129–147.
Jha, M., Moore, K., and Pashaie, B. (2004). “Emergency evacuation planning with microscopic traffic simulation.” Transportation Research Record 1886, Transportation Research Board, Washington, DC.
KLD Associates. (1984). “Formulations of the DYNEV and I-DYNEV traffic simulation models used in ESF.” Technical Rep., Federal Emergency Management Agency, Washington DC.
Knabb, R. D., Brown, D. P., and Rhome, J. R. (2006). “Tropical cyclone report—Hurricane Rita.” National Hurricane Center, 〈http://www.nhc.noaa.gov/pdf/TCR-AL182005_Rita.pdf〉 (May 15, 2013).
Lim, E., and Wolshon, B. (2005). “Modeling and performance assessment of contraflow evacuation termination points.” Transportation Research Record 1922, Transportation Research Board, Washington, DC.
Lindell, M. K., and Prater, C. S. (2007). “Critical behavioral assumptions in evacuation time estimate analysis for private vehicles: Examples from hurricane research and planning.” J. Urban Plann. Dev., 133(1), 18–29.
Lo, H. K., and Szeto, W. Y. (2002). “A cell-based variational inequality formulation of the dynamic user optimal assignment problem.” Transp. Res. Part B, 36(5), 421–443.
Mahmassani, H. S. (2001). “Dynamic network traffic assignment and simulation methodology in advanced system management applications.” Networks and Spatial Econ., 1(3–4), 267–292.
Mahut, M., Florian, M., Tremblay, N., Campbell, M., Patman, D., and McDaniel, Z. K. (2004). “Calibration and application of a simulation-based dynamic traffic assignment model.” Transportation Research Record 1876, Transportation Research Board, Washington, DC.
Merchant, D. K., and Nemhauser, G. L. (1978a). “A model and an algorithm for the dynamic traffic assignment problem.” Transp. Sci., 12(3), 183–199.
Merchant, D. K., and Nemhauser, G. L. (1978b). “Optimality conditions for a dynamic traffic assignment model.” Transp. Sci., 12(3), 200–207.
Nava, E., Shelton, J., and Chiu, Y.-C. (2012). “Analyzing impacts of dynamic reversible lane systems using a multi-resolution modeling approach.” 91st Transportation Research Board Annual Meeting, Transportation Research Board, Washington, DC.
Newell, G. F. (1993a). “A simplified theory of kinematic waves in highway traffic, part I: General theory.” Transp. Res. Part B, 27(4), 281–287.
Newell, G. F. (1993b). “A simplified theory of kinematic waves in highway traffic, part II: Queuing at freeway bottlenecks.” Transp. Res. Part B, 27(4), 289–303.
Newell, G. F. (1993c). “A simplified theory of kinematic waves in highway traffic, part III: Multi-destination flows.” Transp. Res. Part B, 27(4), 305–313.
Nguyen, S., and Dupius, C. (1984). “An efficient method for computing traffic equilibria in networks with asymmetric transportation costs.” Transp. Sci., 18(2), 185–202.
Peeta, S., and Ziliaskopoulos, A. K. (2001). “Foundations of dynamic traffic assignment: The past, the present and the future.” Networks and Spatial Econ., 1(3–4), 233–265.
Ran, B., and Boyce, D. E. (1996). “A link-based variational inequality formulation of ideal dynamic user-optimal route choice problem.” Transp. Res. Part C, 4(1), 1–12.
Ran, B., Boyce, D. E., and LeBlanc, L. J. (1993). “A new class of instantaneous dynamic user-optimal traffic assignment models.” Oper. Res., 41(1), 192–202.
Ran, B. R., Hall, R. W., and Boyce, D. E. (1996). “A link-based variational inequality model for dynamic departure time/route choice.” Transp. Res. Part B, 30(1), 31–46.
Rathi, A. K., and Solanki, R. S. (1993). “Simulation of traffic flow during emergency evacuations: a microcomputer based modeling system.” Proc., 1993 Winter Simulation Conf., IEEE, New York, 1250–1258.
Sbayti, H., and Mahmassani, H. S. (2006). “Optimal scheduling of evacuation operations.” Transportation Research Record 1964, Transportation Research Board, Washington, DC.
Sheffi, Y., Mahmassani, H., and Powell, W. B. (1982). “A transportation network evacuation model.” Transp. Res. Part A, 16(3), 209–218.
Smith, L., Beckman, R., Anson, D., Nagel, K., and Williams, M. (1995). “TRANSIMS: Transportation analysis and simulation system.”, U.S. Dept. of Transportation, Washington DC.
Southworth, F., Janson, B. N., and Venigalla, M. M. (1992). “DYMOD: Towards real time, dynamic traffic routing during mass evacuations.” Proc., Int. Emergency Management and Engineering Conf.: Managing Risk with Computer Simulation, Society for Computer Simulation, San Diego, 84–89.
Taylor, N. B. (2003). “The CONTRAM dynamic traffic assignment model.” Networks Spatial Econ., 3(3), 297–322.
Theodoulou, G., and Wolshon, B. (2004). “Alternative methods to increase the effectiveness of freeway contraflow evacuation.” Transportation Research Record 1865, Transportation Research Board, Washington, DC.
Waller, S. T., and Ziliaskopoulos, A. (2006). “A combinatorial user optimal dynamic traffic assignment algorithm.” Ann. Oper. Res., 144(1), 249–261.
Wie, B. (1991). “Dynamic analysis of user optimized network flows with elastic demand.” Transportation Research Record 1328, Transportation Research Board, Washington, DC.
Wie, B. W., Friesz, T. L., and Tobin, R. L. (1990). “Dynamic user optimal traffic assignment on congested multidestination networks.” Transp. Res. Part B, 24(6), 431–442.
Williams, B. M., Tagliaferri, A. P., Meinhold, S. S., Hummer, J. E., and Rouphail, N. M. (2007). “Simulation and analysis of freeway lane reversal for coastal hurricane evacuation.” J. Urban Plann. Dev., 133(1), 61–72.
Yazici, A., and Ozbay, K. (2010). “Evacuation network modeling via dynamic traffic assignment with probabilistic demand and capacity constraints.” Transportation Research Record 2196, Transportation Research Board, Washington, DC.
Yperman, I. (2007). “The link transmission model for dynamic network loading.” Ph.D. thesis, Katholieke Universiteit Leuven, Flanders, Belgium.
Yperman, I., Tampère, C. M. J., and Immers, L. H. (2007). “A kinematic wave dynamic network loading model.” 86th Transportation Research Board Annual Meeting, Transportation Research Board, Washington, DC.
Ziliaskopoulos, A. K. (2000). “A linear programming model for the single destination system optimum dynamic traffic assignment problem.” Transp. Sci., 34(1), 37–49.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering
Journal of Transportation Engineering
Volume 139Issue 8August 2013
Pages: 822 - 832

History

Received: Jul 7, 2012
Accepted: Nov 1, 2012
Published online: Nov 3, 2012
Discussion open until: Apr 3, 2013
Published in print: Aug 1, 2013

Permissions

Request permissions for this article.

Authors

Affiliations

Anna C. Y. Li
School of Civil and Environmental Engineering, Cornell Univ., Ithaca, NY 14853.
Linda Nozick [email protected]
School of Civil and Environmental Engineering, Cornell Univ., Ithaca, NY 14853 (corresponding author). E-mail: [email protected]
Rachel Davidson
Dept. of Civil and Environmental Engineering, Univ. of Delaware, Newark, DE 19716.
Nathanael Brown
Sandia National Laboratories, Albuquerque, NM 87185-1138.
Dean A. Jones
Sandia National Laboratories, Albuquerque, NM 87185-1138.
Brian Wolshon
Gulf Coast Research Center for Evacuation and Transportation Resiliency, Dept. of Civil and Environmental Engineering, Louisiana State Univ., Baton Rouge, LA 70803-6405.

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