Parallel optimization for traffic assignment

Parallel optimization for traffic assignment

0.00 Avg rating0 Votes
Article ID: iaor1988237
Country: Netherlands
Volume: 42
Issue: 2
Start Page Number: 327
End Page Number: 345
Publication Date: Nov 1988
Journal: Mathematical Programming
Authors: ,
Keywords: transportation: road, Transportation: Road
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.