EQUILIBRIUM TRAFFIC ASSIGNMENT ON A NETWORK WITH CONGESTED FLOWS

Abstract

Equilibrium traffic assignment on a congested network is dealt by considering queues at intersections. The travel time on a link with congested flow is expressed as the sum of running time at non-congested flow regime and imaginary waiting time at the end of link. Traffic volume on links and waiting time in queues are required through equilibrium conditions. The problem is formed as a convex programming, which has explicit capacity restraints. The problem is transformed the ordinary traffic assignment problem by use of interior penalty function method. The solution is required as the limit value of solutions of them. The waiting time on a congested link is equivalent to the derivative of penalty function. A feasible point search using the solution algorithm itself is suggested. In this method, not only traffic volume but also the length and waiting time of stationary traffic congestion can be expected, and the solution algorithm is enough practical.

Cite this work

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

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

Papers that cite the same references — the relational fallback while embeddings are still backfilling.