Download or read book Decomposition Techniques for the Traffic Assignment Problem written by Siriphong Lawphongpanich and published by . This book was released on 1983 with total page 214 pages. Available in PDF, EPUB and Kindle. Book excerpt: This study is concerned with decomposition techniques for the traffic assignment problem. In particular, it generalizes earlier decomposition results for the standard traffic assignment problem in which the travel cost function has a symmetric Jacobian to the case where the Jacobian is asymmetric. The standard traffic assignment problem is often formulated as an optimization problem, whereas the asymmetric case can be formulated in several ways. however, the variational inequality formulation seems to be the most useful and is adopted for this study. Decomposition ideas originally developed for the optimization formulation are extended to the variational inequality problem. new convergent algorithms for both forms of the traffic assignment problem are given and explored computationally. particular attention is given to computer storage requirements and the application of the projection technique to the master problem of simplicial decomposition. Transfer decomposition is developed for problems which are only partially asymmetric. this technique decomposes the problem into two variational inequality problems, one of which is equivalent to the standard traffic assignment problem. Furthermore, the impact of transfer decomposition as a tool in network aggregation is also explored.