Solving the dynamic traffic assignment problem on a hypercube multicomputer

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 problem...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part B: methodological 1990-12, Vol.24 (6), p.443-451
Main Author: Ho, James K.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0191-2615
1879-2367
DOI:10.1016/0191-2615(90)90039-2