Simultaneous Perturbation Stochastic Approximation Algorithm for Solving Stochastic Problems of Transportation Network Analysis: Performance Evaluation

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.

• Record URL:
  https://doi.org/10.3141/2085-02
• Summary URL:
  http://scholar.google.com/scholar_lookup?title=Simultaneous+Perturbation+Stochastic+Approximation+Algorithm+for+Solving+Stochastic+Problems+of+Transportation+Network+Analysis%3a+Performance+Evaluation&author=E.+Ozguven&author=K.+Ozbay&publication_year=2008
• Availability:
  • Find a library where document is available. Order URL: http://www.trb.org/Main/Public/Blurbs/160709.aspx
• Authors:
  • Ozguven, Eren Erman
  • Ozbay, Kaan
• Publication Date: 2008

Language

• English

Media Info

• Media Type: Print
• Features: Figures; References; Tables;
• Pagination: pp 12-20
• Monograph Title: Network Modeling 2008
• Serial:
  • Transportation Research Record: Journal of the Transportation Research Board
  • Issue Number: 2085
  • Publisher: Transportation Research Board
  • ISSN: 0361-1981

Subject/Index Terms

• TRT Terms: Accuracy; Algorithms; Approximation (Mathematics); Mathematical analysis; Network analysis (Planning); Perturbations; Stochastic processes; Traffic assignment
• Uncontrolled Terms: Computational time; Method of successive averages; Transportation networks
• Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01099530
• Record Type: Publication
• ISBN: 9780309125963
• Files: TRIS, TRB
• Created Date: May 21 2008 7:08AM