Algorithms for solving fisk's stochastic traffic assignment model
In 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).
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:25:y:1991:i:6:p:405-412. 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 references are entirely missing, you can add them using this form.