Solving the dynamic traffic assignment problem on a hypercube multicomputer

James K. Ho

Transportation Research Part B: Methodological, 1990, vol. 24, issue 6, 443-451

Abstract: We consider a dynamic traffic assignment problem in which congestion is modeled explicitly. It has been shown previously that the piecewise linearized problem can be solved by a sequence of linear programs. However, for the dynamic control of traffic networks, the dimensions of the resulting problems are likely to be prohibitive. Since the linear programs have the staircase structure, we propose to apply nested decomposition algorithms. The approach becomes particularly attractive with the advent of computers with multiple processors as the subproblems can be solved concurrently. In this paper, we demonstrate this application on an Intel iPSC/2 hypercube computer.

Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(90)90039-2
Full text for ScienceDirect subscribers only

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: https://EconPapers.repec.org/RePEc:eee:transb:v:24:y:1990:i:6:p:443-451

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().