Convergence of Traffic Assignments: How Much is Enough?
Publication: Journal of Transportation Engineering
Volume 130, Issue 1
Abstract
Daily traffic assignments to a large-scale road network are described for build and no-build scenarios to evaluate the addition of two proposed ramps between I-295 and SR-42 in the New Jersey part of the Delaware Valley region. The road network consists of 39,800 links connecting 1,510 zones. The user-equilibrium traffic-assignment problem was solved with a new algorithm called origin-based assignment (OBA), which can achieve highly converged solutions with reasonable computing effort. Following a description of the user-equilibrium traffic-assignment problem and the OBA algorithm, the stability of link-flow differences between the two scenarios in the vicinity of the proposed ramps are examined over a broad range of assignment convergence levels. Then, link-flow differences over this range of convergence levels are compared to link-flow differences between two very highly converged solutions. Examination of the findings reveals, in the writers’ view, that a relative gap of 0.01% (0.0001) is required to ensure that the traffic assignments are sufficiently converged to achieve link-flow stability. These convergence levels are then interpreted in terms of the number of Frank-Wolfe iterations needed to achieve comparable relative gaps as well as the computational effort required.
Get full access to this article
View all available purchase options and get full access to this article.
References
Bar-Gera, H. (1999). “Origin-based algorithms for transportation network modeling.” PhD thesis, Univ. of Illinois at Chicago; Technical Rep. No. 103, 〈http://www.niss.org/〉.
Bar-Gera, H.(2002). “Origin-based algorithm for the traffic assignment problem.” Transp. Sci., 36(4), 398–417.
Bar-Gera, H. (2003). “Executable code for origin-based assignment.” 〈http://www.openchannelsoftware.org/projects/origin-based-assignment〉.
Boyce, D., Ralevic-Dekic, B., and Bar-Gera, H. (2001). “Convergence of traffic assignments: How much is enough?” Annual Meeting, Transportation Research Board, Washington, D.C., presentation.
EMME/2 release 9. (1998). INRO Consultants, Inc., Montréal.
Janson, B., and Zozaya-Gorostiza, C.(1987). “The problem of cyclic flows in traffic assignment.” Transp. Res., 21B(4), 299–310.
Kupsizewska, D., and Van Vliet, D. (1999). “101 uses for path-based assignment.” Transport Planning Methods: Proc., Seminar C, PTRC Planning and Transport Summer Ann. Meeting, Univ. of Sussex, U.K.
Ralevic-Dekic, B. (2000). “Convergence of link flow solutions by origin-based and link-based traffic assignment algorithms.” MS thesis, Univ. of Illinois at Chicago.
Information & Authors
Information
Published In
Copyright
Copyright © 2004 American Society of Civil Engineers.
History
Received: Apr 9, 2002
Accepted: Mar 17, 2003
Published online: Dec 15, 2003
Published in print: Jan 2004
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.