en Other Other پژوهشی Original <p>The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders&#39; decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master problem and a sub problem. The first one was a nonlinear and the latter a linear programming problem. Iteratively, the master problem was solved and its outputs were used to solve the sub-problem in which to form appropriate cuts and add them to the master problem for solving it in the next iteration. Based on the convergence of Benders&#39; decomposition, the iterative process was terminated in a finite number of steps. In this manner, some numerical examples were explained and compared with other methods.</p> Benders' Decomposition, Benders' cut, Stochastic User Equilibrium, Traffic Assignment 0 0 http://iors.ir/journal/browse.php?a_code=A-11-530-1&slc_lang=en&sid=1 A Fakharzadeh a_fakharzadeh@sutech.ac.ir 00031947532846001393 00031947532846001393 No S Mahmoodi somayeh.mahmoodi62@gmail.com 00031947532846001394 00031947532846001394 Yes