Dynamic Route Choice Model of Large-Scale Traffic Network
Publication: Journal of Transportation Engineering
Volume 123, Issue 4
Abstract
Application and extensions of a dynamic network equilibrium model to the Advanced Driver and Vehicle Advisory Navigation Concept (ADVANCE) Network are described in this paper. ADVANCE is a dynamic route guidance field test designed for 800 km2 in the northwestern suburbs of Chicago. The dynamic route choice model employed in this paper is solved efficiently by a modified version of Janson's DYMOD algorithm. Realistic traffic engineering-based link delay functions, instead of the simplistic Bureau of Public Roads (BPR) function, are used to estimate link travel times and intersection delays for most types of links and intersections. Further, an expanded intersection representation is utilized, resulting in a network of nearly 23,000 links and 10,000 nodes. Time-dependent link flows, travel times, speeds and queue spillbacks are generated for the ADVANCE Network. The model was solved on a CONVEX-C3880. Convergence and computational results are presented and analyzed.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Akçelik, R. (1981). “Traffic signals: capacity and signal timing analysis.”Res. report ARR, 123, 5th Reprint, 1993, Australian Road Research Board, Melbourne, Australia.
2.
Berka, S., and Boyce, D. E. (1996). “Generating highway travel times with a large-scale asymmetric user equilibrium assignment model.”Advanced methods in transportation analysis, L. Bianco and P. Toth, eds., Springer-Verlag KG, Berlin, Germany, 29–61.
3.
Bureau of Public Roads. (1964). Traffic assignment manual. U.S. Department of Commerce, Washington, D.C.
4.
Carey, M.(1986). “A constraint qualification for a dynamic traffic assignment model.”Transp. Sci., 20, 55–88.
5.
Carey, M.(1987). “Optimal time-varying flows on congested networks.”Operations Res., 35, 58–69.
6.
Carey, M. (1992). “Nonconvexity of the dynamic traffic assignment problem.”Transp. Res., 26B, Elsevier Science, Oxford, U.K., 127–133.
7.
Frank, M., and Wolfe, P. (1956). “An algorithm for quadratic programming.”Naval Res. Logistics Quarterly 3, 95–110.
8.
Friesz, T. L., Luque, F. J., Tobin, R. L., and Wie, B.-W.(1989). “Dynamic network traffic assignment considered a continuous time optimal control problem.”Operations Res., 37, 893–901.
9.
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.”Operations Res., 41, 179–191.
10.
Janson, B. N. (1991a). “Dynamic traffic assignment for urban networks.”Transp. Res., 25B, Elsevier Science, Oxford, U.K., 143–161.
11.
Janson, B. N. (1991b). “A convergent algorithm for dynamic traffic assignment.”Transp. Res. Record 1328, Transportation Research Board, Washington, D.C., 69–80.
12.
Janson, B. N.(1995). “Network design effects of dynamic traffic assignment.”J. Transp. Engrg., ASCE, 121(1), 1–13.
13.
Janson, B. N., and Robles, J. (1993). “Dynamic traffic assignment with arrival time costs.”Proc., 12th Int. Symp. on Transp. and Traffic Theory, Elsevier Science, Oxford, U.K., 127–146.
14.
Janson, B. N., and Robles, J. (1995). “A quasi-continuous dynamic traffic assignment model.”Transp. Res. Record 1493, Transportation Research Board, Washington, D.C., 199–206.
15.
Kyle, M., and Marek, J. (1989). “Estimating capacity in delay at a single-lane approach all-way-stop controlled intersection.”Transp. Res. Record 1225, Transportation Research Board, Washington, D.C., 73–82.
16.
Mahmassani, H.S., and Peeta, S. (1993). “Network performance under system optimal and user equilibrium dynamic assignments: implications for ATIS.”Transp. Res. Record 1408, Transportation Research Board, Washington, D.C., 83–93.
17.
Meneguzzer, C. (1995). “An equilibrium route choice model with explicit treatment of the effect of intersection.”Transp. Res., 29B, Elsevier Science, Oxford, U.K., 329–356.
18.
Merchant, D. K., and Nemhauser, G. L.(1978a). “A model and an algorithm for the dynamic assignment problems.”Transp. Sci., 12, 183–199.
19.
Merchant, D. K., and Nemhauser, G. L.(1978b). “Optimality conditions for a dynamic traffic assignment model.”Transp. Sci., 12, 200–207.
20.
Ran, B., and Boyce, D. (1996). Modeling dynamic transportation networks. Springer-Verlag KG, Berlin, Germany.
21.
Ran, B., Boyce, D. E., and LeBlanc, L. J.(1993). “A new class of instantaneous dynamic user-optimal traffic assignment models.”Operations Res., 41, 192–202.
22.
Robles, J., and Janson, B. N. (1995). “Dynamic traffic modeling of the I-25 HOV corridor southeast of Denver.”Transp. Res. Record 1516, Transportation Research Board, Washington, D.C., 48–60.
23.
Van Aerde, M., and Yagar, S. (1988). “Modeling integrated freeway/traffic signal networks: a proposed routing-based approach.”Transp. Res., 22A, Elsevier Science, Oxford, U.K., 445–453.
24.
Webster, F. V. (1958). “Traffic signal settings.”Road Res. Tech. Paper, 39, Road Research Laboratory, Her Majesty's Stationery Office, London, U.K.
25.
Wie, B.-W. (1989). “An application of optimal control theory to dynamic user-equilibrium traffic assignment.”Transp. Res. Record 1251, Transportation Research Board, Washington, D.C., 66–73.
26.
Wie, B.-W. (1991). “Dynamic analysis of user optimized network flows with elastic demand.”Transp. Res. Record 1328, Transportation Research Board, Washington, D.C., 81–87.
27.
Wie, B.-W., Friesz, T. L., and Tobin, R. L. (1990). “Dynamic user-optimal traffic assignment on congested multi-destination networks.”Transp. Res., 24B, Elsevier Science, Oxford, U.K., 431–442.
28.
Zhang, Y., Hicks, J., and Boyce, D. (1994). “Trip data factoring for the ADVANCE network flow model.”ADVANCE Working Paper 43, Urban Transportation Center, Univ. of Illinois, Chicago.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 123 • Issue 4 • July 1997
Pages: 276 - 282
Copyright
Copyright © 1997 American Society of Civil Engineers.
History
Published online: Jul 1, 1997
Published in print: Jul 1997
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.