Network Design Effects of Dynamic Traffic Assignment
Publication: Journal of Transportation Engineering
Volume 121, Issue 1
Abstract
This paper examines the effects of dynamic user-equilibrium (DUE) traffic assignment with scheduled trip arrival times on network design outcomes in comparison to outcomes with steady-state travel demands. The objective is to minimize systemwide travel cost by considering alternative link improvements to an existing network (e.g., select among budget-constrained subsets of link-improvement candidates). DUE is a temporal generalization of static user-equilibrium (SUE) assignment with additional constraints to insure temporally continuous trip paths and first-in first-out (FIFO) trip ordering between all origin-destination pairs. Previous research has not investigated the effects of dynamic travel demands and schedule delay (i.e., shifts by trips to earlier or later arrival times) on network design with multiple trip origins and destinations. DUE is formulated as a bilevel program of two subproblems solved successively by an iterative algorithm that consistently converges to solutions that closely satisfy the necessary optimality conditions of this problem. Examples show the impacts of alternative combinations of network changes affecting capacities and/or free-flow travel times (e.g., ramp metering or road widening) to depend on temporal travel demands and schedule delay distributions.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Abdulaal, M., and LeBlanc, L. J. (1979). “Continuous equilibrium network design models.”Transp. Res., Vol. 13B, 19–32.
2.
Arnott, R., de Palma, A., and Lindsey, R.(1993). “Properties of dynamic traffic equilibrium involving bottlenecks, including a paradox and metering.”Transp. Sci., 27(2), 148–160.
3.
Bertsekas, D. P. (1991). Linear network optimization: algorithms and codes . M. I. T. Press, Cambridge, Mass.
4.
Boyce, D. E. (1984). “Urban transportation network-equilibrium and design models: recent achievements and future prospects.”Envir. and Plng., Vol. 16A, 1445–1474.
5.
Boyce, D. E., and Janson, B. N. (1980). “A discrete transportation network design problem with combined trip distribution and assignment.”Transp. Res., 14B(2), 147–154.
6.
Carey, M.(1987). “Optimal time-varying flows on congested networks.”Operations Res., 35(1), 58–69.
7.
Carey, M. (1992). “Nonconvexity of the dynamic assignment problem.”Transp. Res., Vol. 26B(2), 127–133.
8.
Friesz, T. L., Luque, J., Tobin, R. L., and Wie, B.(1989). “Dynamic network traffic assignment considered as a continuous time optimal control problem.”Operations Res., 37(6), 893–901.
9.
Hearn, D. W. (1982). “The gap function of a convex program.”Operations Res. Letters, Vol. 1, 67–71.
10.
Janson, B. N. (1991a). “Dynamic traffic assignment for urban road networks.”Transp. Res., 25B(2/3), 143–161.
11.
Janson, B. N. (1991b). “A convergent algorithm for dynamic traffic assignment.”Transp. Res. Rec. 1328, Transportation Research Board, Washington, D.C., 69–80.
12.
Janson, B. N. (1991c). “Dynamic network modeling of travel guidance impacts.”Proc., Vehicle Navigation and Information Systems Conf., Dearborn, Mich., 857–870.
13.
Janson, B. N. (1992a). “Dynamic network assignment with schedule delay.”Proc., 71st Annu. Meeting, Transportation Research Board, Washington, D.C.
14.
Janson, B. N. (1992b). “Combined dynamic distribution and assignment with variable departure or arrival times.”Rep., Dept. of Civ. Engrg., University of Colorado at Denver.
15.
Janson, B. N. (1992c). “A general dynamic assignment model and solution algorithm.”Rep., Dept. of Civ. Engrg., University of Colorado at Denver.
16.
Janson, B. N., and Robles, J. (1993). “Dynamic traffic assignment with arrival time costs.”Proc., 12th Int. Symp. on Transp. and Traffic Theory, Carlos Daganzo, ed., Berkeley, Calif.
17.
Janson, B. N., and Southworth, F. (1992). “Estimating departure times from traffic counts using dynamic assignment.”Transp. Res., 26B(1), 3–16.
18.
Kaufman, D. E., and Smith, R. L.(1993). “Fastest paths in time-dependent networks for IVHS application.”IVHS J., 1(1), 1–11.
19.
LeBlanc, L. J. (1975). “An algorithm for the discrete network design problem.”Transp. Sci., Vol. 9, 183–199.
20.
Magnanti, T. L., and Wong, R. T. (1984). “Network design and transportation planning: models and algorithms.”Transp. Sci., Vol. 18, 1–55.
21.
Merchant, D. K., and Nemhauser, G. L.(1978a). “A model and an algorithm for the dynamic traffic assignment problem.”Transp. Sci., 12(2), 183–199.
22.
Minty, G. J. (1957). “A comment on the shortest path problem.”Operations Res., Vol. 5, 724.
23.
Ran, B., Boyce, D. E., and LeBlanc, L. J.(1993). “A new class of instantaneous dynamic user-optimal traffic assignment models.”Operations Res., 41(1), 192–202.
24.
Rose, G., Daskin, M. S., and Koppelman, F. S. (1988). “An examination of convergence errors in equilibrium traffic assignment models.”Transp. Res., 22B(4), 261–274.
25.
Steinberg, R., and Zangwill, W. I.(1983). “The prevalence of Braess' paradox.”Transp. Sci., 17(3), 301–318.
26.
Steinberg, R., and Stone, R. E.(1988). “The prevalence of paradoxes in transportation equilibrium problems.”Transp., Sci., 22(4), 231–241.
27.
Van Aerde, M., and Yagar, S. (1988). “Dynamic integrated freeway/traffic signal networks: a routing based modeling approach.”Transp. Res., A(6), 445–453.
28.
Wardrop, J. G. (1952). “Some theoretical aspects of road traffic research.”Proc., Institution of Civil Engineers, London, England, Vol. 1, Part 2, 325–378.
29.
Wie, B. (1991). “Dynamic analysis of user optimized network flows with elastic demand.”Transp. Res. Rec. 1328, Transportation Research Board, Washington, D.C., 81–87.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 121 • Issue 1 • January 1995
Pages: 1 - 13
Copyright
Copyright © 1995 American Society of Civil Engineers.
History
Published online: Jan 1, 1995
Published in print: Jan 1995
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.