We present an origin-based algorithm for the traffic assignment problem, which is similar
conceptually to the algorithm proposed by Gallager and Bertsekas for routing in …

The discrete network design problem deals with the selection of link additions to an existing
road network, with given demand from each origin to each destination. The objective is to …

This paper presents a novel user-equilibrium (UE) traffic assignment algorithm, which under
conventional assumptions, promises to compute UE arc flows to acceptable precision …

Daily traffic assignments to a large-scale road network are described for build and no-build
scenarios to evaluate the addition of two proposed ramps between I-295 and SR-42 in the …

This paper studies a class of bush-based algorithms (BA) for the user equilibrium (UE) traffic
assignment problem, which promise to produce highly precise solutions by exploiting …

This paper introduces a new parallel computing algorithm to address the user equilibrium
(UE) problem. Searching for efficient solution algorithms for UE has been a recurring study …

Consistent transportation forecasting models that combine travel demand and network
assignment are receiving more attention in recent years. A fixed point formulation for the …

This article deals with the problem of estimating and updating the origin‐destination matrix
and link flows from traffic counts and its optimal location. A combination (bi‐level) of an OD …

The user equilibrium traffic assignment principle is very important in the traffic assignment
problem. Mathematical programming models are designed to solve the user equilibrium …

A new adaptation of Rosen's projected gradient algorithm for solving fixed-demand
equilibrium traffic assignments is developed. It is based on a Gauss-Seidel decomposition …