Massively Parallel Computation of Dynamic Traffic Problems Modeled as Projected Dynamical Systems
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.
|Date of creation:|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.unige.ch/ce/ce96/welcome.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hans M. Amman & David A. Kendrick, . "Computational Economics," Online economics textbooks, SUNY-Oswego, Department of Economics, number comp1, September.
- Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
- Nagurney, Anna & Takayama, Takashi & Zhang, Ding, 1995. "Massively parallel computation of spatial price equilibrium problems as dynamical systems," Journal of Economic Dynamics and Control, Elsevier, vol. 19(1-2), pages 3-37.
When requesting a correction, please mention this item's handle: RePEc:sce:scecf6:_039. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.