Models and algorithms for the traffic assignment problem with link capacity constraints
This paper explores the models as well as solution techniques for the link capacitated traffic assignment problem (CTAP) that is capable of offering more realistic traffic assignment results. CTAP can be approximated by the uncapacitated TAP using different dual/penalty strategies. Two important and distinctive approaches in this category are studied and implemented efficiently. The inner penalty function (IPF) approach establishes a barrier on the boundary of the feasible set so that constraints are not violated in the solution process, and the augmented Lagrangian multiplier (ALM) approach combines the exterior penalty with primal-dual and Lagrangian multipliers concepts. In both implementations, a gradient projection (GP) algorithm was adopted as the uniform subproblem solver for its excellent convergence property and reoptimization capability. Numerous numerical results demonstrated through efficient implementations of either the IPF or the ALM approach that CTAP is computationally tractable even for large-scale problems. Moreover, the relative efficiency of IPF and ALM was explored and their sensitivity to different algorithmic issues was investigated.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 38 (2004)
Issue (Month): 4 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Yang, Hai & Yagar, Sam, 1995. "Traffic assignment and signal control in saturated road networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 125-139, March.
- Jayakrishnan, R. & Tsai, Wei T. & Prashker, Joseph N. & Rajadhyaksha, Subodh, 1994. "A Faster Path-Based Algorithm for Traffic Assignment," University of California Transportation Center, Working Papers qt2hf4541x, University of California Transportation Center.
- Yang, Hai & Yagar, Sam, 1994. "Traffic assignment and traffic control in general freeway-arterial corridor systems," Transportation Research Part B: Methodological, Elsevier, vol. 28(6), pages 463-486, December.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:38:y:2004:i:4:p:285-312. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.