Investigating path-based solution algorithms to the stochastic user equilibrium problem
This paper focuses on path-based solution algorithms to the stochastic user equilibrium (SUE) and investigates their convergence properties. Two general optimization methods are adapted to solve the logit SUE problem. First, a method that closely follows the Gradient Projection (GP) algorithm developed for the deterministic problem is derived. While this method is very efficient for the deterministic user equilibrium problem, we use a simple example to illustrate why it is not suitable for the SUE problem. Next, a different variant of gradient projection, which exploits special characteristics of the SUE solution, is presented. In this method the projection is on the linear manifold of active constraints. The algorithms are applied to solve simple networks. The examples are used to compare the convergence properties of the algorithms with a path-based variant of the Method of Successive Averages (MSA) and with the Disaggregate Simplicial Decomposition (DSD) algorithm.
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): 39 (2005)
Issue (Month): 3 (March)
|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.:
- Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
- Mingyuan Chen & Attahiru Sule Alfa, 1991. "Algorithms for solving fisk's stochastic traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 25(6), pages 405-412, December.
- Prashker, Joseph N. & Bekhor, Shlomo, 2000. "Some observations on stochastic user equilibrium and system optimum of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 277-291, May.
- Leurent, Fabien M., 1997. "Curbing the computational difficulty of the logit equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 315-326, August.
- Fisk, Caroline, 1980. "Some developments in equilibrium traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 243-255, September.
- Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
- 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.
- Damberg, Olof & Lundgren, Jan T. & Patriksson, Michael, 1996. "An algorithm for the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 115-131, April.
- Chen, Anthony & Lee, Der-Horng & Jayakrishnan, R., 2002. "Computational study of state-of-the-art path-based traffic assignment algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 59(6), pages 509-518.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:39:y:2005:i:3:p:279-295. 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.