Parallel optimization for traffic assignment

Rong-Jaye Chen*, R. R. Meyer

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


Most large-scale optimization problems exhibit structures that allow 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.

Original languageEnglish
Pages (from-to)327-345
Number of pages19
JournalMathematical Programming, Series B
Issue number1-3
StatePublished - 1 Apr 1988

Fingerprint Dive into the research topics of 'Parallel optimization for traffic assignment'. Together they form a unique fingerprint.

Cite this