Parallel optimization for traffic assignment

From MaRDI portal





Most large-scale optimization problems exhibit structures that allows the possibility of attack via algorithms that exhibit a high level of parallelism. The emphasis of this paper is the development of parallel optimization algorithms for a class of convex, block-structured problems. Computational experience is cited for some large-scale problems arising from traffic assignment applications. The algorithms considered here have the property that they allow such problems to be decomposed into a set of smaller optimization problems at each major iteration. These smaller problems correspond to linear single-commodity networks in the traffic assignment case, and they may be solved in parallel. Results are given for the distributed solution of such problems on the CRYSTAL multicomputer.











This page was built for publication: Parallel optimization for traffic assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116876)