A DISTRIBUTED ALGORITHM FOR THE DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENT PROBLEM

M B Wistem · Mike Smith

7 citations0/0 files stored

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Network Traffic and Congestion Control Traffic control and management

Abstract

In this paper the dynamic traffic assignment problem has been formulated in the space of splitting rates. The ideas in Gallager's method for steady-state message routeing in computer networks have been combined with Smith'a Algorithm (D) for computing traffic equilibria and then extended to dynamic-state. The result is a distributed algorithm that seeks to solve the dynamic traffic assignment problem by iteratively adjusting splitting rates at each junction according to the costs of reaching destinations from the exits of that junction. (A) For the covering abstract see IRRD 886400.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 7 citations exist upstream.

Cited by

2005An heuristic algorithm for simulation-based dynamic traffic assignment

Imported from OpenAlex (CC0) — nothing here is generated.