TY - JOUR

T1 - Simultaneous perturbation stochastic approximation algorithm for solving stochastic problems of transportation network analysis

T2 - Performance evaluation

AU - Ozguven, Eren Erman

AU - Ozbay, Kaan

PY - 2008

Y1 - 2008

N2 - Stochastic optimization has become one of the important modeling approaches in transportation network analysis. For example, for traffic assignment problems based on stochastic simulation, it is necessary to use a mathematical algorithm that iteratively seeks out the optimal, the suboptimal solution, or both, because an analytical (closed-form) objective function is not available. Therefore, efficient stochastic approximation algorithms that can find optimal or suboptimal solutions to these problems are needed. The method of successive averages (MSA), a well-known algorithm, is used to solve both deterministic and stochastic equilibrium assignment problems. As found in previous studies, the MSA has questionable convergence characteristics, especially when the number of iterations is not sufficiently large. In fact, the stochastic approximation algorithm is of little practical use if the number of iterations to reduce the errors to within reasonable bounds is arbitrarily large. An efficient method to solve stochastic approximation problems is the simultaneous perturbation stochastic approximation (SPSA), which can be a viable alternative to the MSA because of its proven power to converge to suboptimal solutions in the presence of stochasticities and its ease of implementation. The performance of MSA and SPSA algorithms is compared for solving traffic assignment problems with varying levels of stochasticities on a small network. The utmost importance is given to comparison of the convergence characteristics of the two algorithms as well as to the computational times. A worst-case scenario is also studied to check the efficiency and practicality of both algorithms in terms of computational times and accuracy of results.

AB - Stochastic optimization has become one of the important modeling approaches in transportation network analysis. For example, for traffic assignment problems based on stochastic simulation, it is necessary to use a mathematical algorithm that iteratively seeks out the optimal, the suboptimal solution, or both, because an analytical (closed-form) objective function is not available. Therefore, efficient stochastic approximation algorithms that can find optimal or suboptimal solutions to these problems are needed. The method of successive averages (MSA), a well-known algorithm, is used to solve both deterministic and stochastic equilibrium assignment problems. As found in previous studies, the MSA has questionable convergence characteristics, especially when the number of iterations is not sufficiently large. In fact, the stochastic approximation algorithm is of little practical use if the number of iterations to reduce the errors to within reasonable bounds is arbitrarily large. An efficient method to solve stochastic approximation problems is the simultaneous perturbation stochastic approximation (SPSA), which can be a viable alternative to the MSA because of its proven power to converge to suboptimal solutions in the presence of stochasticities and its ease of implementation. The performance of MSA and SPSA algorithms is compared for solving traffic assignment problems with varying levels of stochasticities on a small network. The utmost importance is given to comparison of the convergence characteristics of the two algorithms as well as to the computational times. A worst-case scenario is also studied to check the efficiency and practicality of both algorithms in terms of computational times and accuracy of results.

UR - http://www.scopus.com/inward/record.url?scp=63849226065&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=63849226065&partnerID=8YFLogxK

U2 - 10.3141/2085-02

DO - 10.3141/2085-02

M3 - Article

AN - SCOPUS:63849226065

SP - 12

EP - 20

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - 2085

ER -