| Article ID: | iaor1993202 |
| Country: | United States |
| Volume: | 25B |
| Issue: | 6 |
| Start Page Number: | 405 |
| End Page Number: | 412 |
| Publication Date: | Dec 1991 |
| Journal: | Transportation Research. Part B: Methodological |
| Authors: | Chen Mingyuan |
| Keywords: | programming: assignment |
In this paper, 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.