Origin-Based Algorithm for the Traffic Assignment Problem
By Hillel Bar-Gera. Transportation Science, 2002
351 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Transportation, Signal Processing
View Paper: https://www.semanticscholar.org/paper/2f90c9c1646e64efd8e957f6459145494db5063e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Transportation
In Signal Processing
Citations in the corpus
- A Regional Economy, Land Use, and Transportation Model (Relu-Tran©): Formulation, Algorithm Design, and Testing (2007, neutral): “Florian and Nguyen (1976) provided one of the earliest and Bar-Gera (2002) one of the most recent algorithms that find traffic equilibria on arbitrarily configured highway networks with fixed capacities, making operational the mathematical programming formulation of static traffic flow by Beckmann,…”
- Solving a Non-Convex Combined Travel Forecasting Model by the Method of Successive Averages with Constant Step Sizes (2006, methodology): “Bar-Gera and Boyce (2003) showed that this model (without the power term) can be formulated as a convex optimization problem, and solved either by a link-based algorithm or more precisely and efficiently by an origin-based algorithm. Tanner (1961) suggested that a compound deterrence function can im”
- Transit assignment: Approach-based formulation, extragradient method, and paradox (2014, methodology): “See Lemmas 1-3 in Bar-Gera (2002).”