Extensions of the static traffic assignment problem with link interactions were studied
extensively in the past. Much of the network modeling community has since shifted to …

This dissertation is concerned with the traffic assignment problem (TAP), an important tool in
transportation planning. We first study a theoretical extension of TAP which incorporates …

A solution method based on Lagrangean dualization and subgradient optimization for the
symmetric traffic equilibrium assignment problem is presented. Its interesting feature is that it …

This paper presents an algorithm for the traffic assignment problem. The algorithm is
characterized by the “origin-based” feature, which solves the user equilibrium flow that is …

Given a traffic network subject to congestion and given demand for travel between origins
and destinations within the network, a user equilibrium is a pattern of flow that satisfies this …

This article shows how Gradient Projection (GP) algorithms are capable of solving with high
precision a Dynamic Traffic Assignment (DTA) model based on implicit path enumeration …

Several analytic approaches have been developed to describe or predict traffic flows on
networks with time-varying (dynamic) travel demands, flows and travel times. A key …

The asymmetric traffic assignment model can improve the traditional traffic assignment
model by adopting detailed network representation and more realistic asymmetric cost …

Since 1956, the Beckmann model is the reference for the static traffic equilibrium problem
not only from a theoretical but also from a practical point of view. In 1998, Nesterov & de …

In this paper we study numerical stability of path-based algorithms for the traffic assignment
problem. These algorithms are based on decomposition of the original problem into smaller …