An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems
As a means to obtain a more accurate description of traffic flows than that provided by the basic model of traffic assignment, there have been suggestions to impose upper bounds on the link flows. This can be done either by introducing explicit link capacities or by employing travel time functions with asymptotes at the upper bounds. Although the latter alternative has the disadvantage of inherent numerical ill-conditioning, the capacitated assignment model has been studied and applied to a limited extent, the main reason being that the solutions can not be characterized by the classical Wardrop equilibrium conditions; they may, however, be characterized as Wardrop equilibria in terms of a well-defined, natural generalized travel cost. The introduction of link capacity side constraints makes the problem computationally more demanding. The availability of efficient algorithms for the basic model of traffic assignment motivates the use of dualization approaches for handling the capacity constraints. We propose and evaluate an augmented Lagrangean dual method in which the uncapacitated traffic assignment subproblems are solved with the disaggregate simplicial decomposition algorithm. This algorithm fully exploits the subproblem's structure and has very favourable reoptimization capabilities; both these properties are necessary for achieving computational efficiency in iterative dualization schemes. The dual method exhibits a linear rate of convergence under a standard nondegeneracy assumption. The efficiency of the overall algorithm is demonstrated through experiments with capacitated versions of well-known test problems, with the conclusion that the introduction of link capacities increases the computing times with no more than a factor of four. The introduction of capacities and the algorithm suggested can be used to derive tolls for the reduction of flows on overloaded links. The solution strategy can be applied also to other types of traffic assignment models where side constraints have been added in order to refine a descriptive or prescriptive assignment model.
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): 29 (1995)
Issue (Month): 6 (December)
|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.:
- Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
- Jeff Kennington & Mohamed Shalaby, 1977. "An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems," Management Science, INFORMS, vol. 23(9), pages 994-1004, May.
- 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.
- Hearn, Donald W. & Lawphongpanich, Siriphong & Nguyen, Sang, 1984. "Convex programming formulations of the asymmetric traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 357-365.
- Hearn, Donald W. & Ribera, Jaime, 1981. "Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 15(6), pages 437-442, December.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:29:y:1995:i:6:p:433-455. 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: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.