Algorithms for solving fisk's stochastic traffic assignment model
AbstractIn this, the logit-based stochastic traffic assignment model is explored. Two new improved algorithms are presented for solving this type of stochastic assignment problem. The major improvement achieved in these algorithms is that the step length in each iteration of the search process is optimized instead of using fixed step lengths as in the existing method of successive averages (MSA).
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part B: Methodological.
Volume (Year): 25 (1991)
Issue (Month): 6 (December)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Chen, Anthony & Pravinvongvuth, Surachet & Xu, Xiangdong & Ryu, Seungkyu & Chootinan, Piya, 2012. "Examining the scaling effect and overlapping problem in logit-based stochastic user equilibrium models," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(8), pages 1343-1358.
- Xie, Chi & Travis Waller, S., 2012. "Stochastic traffic assignment, Lagrangian dual, and unconstrained convex optimization," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1023-1042.
- Huang, Hai-Jun & Bell, Michael G. H., 1998. "A study on logit assignment which excludes all cyclic flows," Transportation Research Part B: Methodological, Elsevier, vol. 32(6), pages 401-412, August.
- Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
- 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.
- Yang, Hai, 1998. "Multiple equilibrium behaviors and advanced traveler information systems with endogenous market penetration," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 205-218, April.
- 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.
- Maher, M. J. & Hughes, P. C., 1997. "A probit-based stochastic user equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 341-355, August.
- Bekhor, Shlomo & Toledo, Tomer, 2005. "Investigating path-based solution algorithms to the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 279-295, March.
- Lam, W. H. K. & Gao, Z. Y. & Chan, K. S. & Yang, H., 1999. "A stochastic user equilibrium assignment model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 351-368, June.
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.