Massively Parallel Computation of Dynamic Traffic Problems Modeled as Projected Dynamical Systems

Anna Nagurney () and Ding Zhang
Additional contact information
Anna Nagurney: Department of Finance and Operations Management, University of Massachusetts
Ding Zhang: Department of Industrial Engineering and Operations Research, University of Massachusetts

Computing in Economics and Finance 1996 from Society for Computational Economics

Abstract: Traffic congestion in the United States alone results in $n100 billion in lost productivity. In this paper we consider the modeling and solution of dynamic traffic models formulated as projected dynamical systems. The proposed discrete time algorithm, the Euler method, resolves the problem at each step into subproblems in path flow variables, all of which can be solved simultaneously and in closed form. Convergence results are also presented. Finally, the algorithm is implemented on the massively parallel architecture, the Thinking Machine's CM-5, and its performance compared to an implementation on the IBM SP2 on several traffic network examples.

View list of references

Downloads: (external link)
http://www.unige.ch/ce/ce96/ps/nagurne1.eps (application/postscript)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:sce:scecf6:_039

Access Statistics for this paper

More papers in Computing in Economics and Finance 1996 from Society for Computational Economics
Address: Department of Econometrics, University of Geneva, 102 Bd Carl-Vogt, 1211 Geneva 4, Switzerland
Contact information at EDIRC.
Series data maintained by Christopher F. Baum ().