A dynamic route assignment model for guided and unguided vehicles with a massively parallel computing architecture

Authors:
G. -L. Chang;T. Junchaya
Affiliations:
Department of Civil Engineering University of Maryland College Park, MD 20742, U.S.A.;Department of Civil Engineering University of Maryland College Park, MD 20742, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1995

Citing 3
Cited 0

Optimal time-varying flows on congested networks

Operations Research
Dynamic network traffic assignment considered as a continuous time optimal control problem

Operations Research
A new class of instantaneous dynamic user-optimal traffic assignment models

Operations Research

Quantified Score

Hi-index	0.98

Visualization

Abstract

This article presents a dynamic assignment model which has been developed primarily for ATMS/ATIS real-time applications. In order to satisfy the real-time computational requirements, the proposed model has been developed on the Connection Machine, CM-2, a massively parallel computer. Its implementation on the Connection Machine is aimed to exploit the parallel nature of the problem and to take advantage of the underlying computing architecture. The model follows an integrated assignment-simulation framework which assigns both guided and unguided vehicles to the network dynamically in both spatial and temporal dimensions. It uses a learning process in which the new route assignment uses information gained from previous iteration in computation of new paths. During each iteration, guided vehicles follow routes according to time-dependent shortest paths while unguided vehicles follow static shortest paths. Several numerical examples have been carried out to illustrate the potential applications in analyzing the network performance under various ATMS scenarios.