Origin-Based Algorithm for the Traffic Assignment Problem

Bar-Gera, Hillel
November 2002
Transportation Science;Nov2002, Vol. 36 Issue 4, p398
Academic Journal
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 telecommunication networks. Apart from being origin-based, the algorithm is different from other algorithms used so far for the traffic assignment problem by its restriction to acyclic solutions and by the use of approach proportions as solution variables. Projected quasiNewton search directions are used to shift flows effectively and to eliminate residual flows. Experimental results comparing the proposed algorithm with the state-of-the-practice algorithm of Frank and Wolfe demonstrate the algorithm's excellent convergence performance, especially when highly accurate solutions are needed. Reasonable memory requirements make this algorithm applicable to large-scale networks. The resulting solution has an immediate route flow interpretation, thus providing equivalent detail to route-based solutions.


Related Articles

  • A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem. Yu (Marco) Nie // Transportation Science;Feb2012, Vol. 46 Issue 1, p27 

    Recently, Bar-Gera (Bar-Gera, H. 2002. Origin-based algorithm for the traffic assignment problem. Transportation Sci. 36(4) 398-417) proposed a quasi-Newton method for the origin-based formulation of the user equilibrium traffic assignment problem. This note shows that Bar-Gera's algorithm may...

  • A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach. Mingyuan Chen; Alfa, Attahiru Sule // Transportation Science;Aug91, Vol. 25 Issue 3, p215 

    In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a stochastic incremental traffic assignment approach. Experiments are performed to compare the behaviors of three assignment methods. Numerical examples are...

  • An Algorithm for the Traffic Assignment Problem. Nguyen, Sang // Transportation Science;Aug74, Vol. 8 Issue 3, p203 

    The traffic assignment problem associated with a given transportation network is the process of distributing zone-to-zone trips on links of the network. A number of methods have been proposed to solve this problem, but none have been found to be entirely satisfactory. This paper is concerned...

  • Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback. Nie, Yu Macro; Zhang, H. M. // Networks & Spatial Economics;Mar2010, Vol. 10 Issue 1, p49 

    This paper studies the dynamic user optimal (DUO) traffic assignment problem considering simultaneous route and departure time choice. The DUO problem is formulated as a discrete variational inequality (DVI), with an embeded LWR-consistent mesoscopic dynamic network loading (DNL) model to...

  • Sensitivity Analysis for Stochastic User Equilibrium Network Flows - A Dual Approach. Ying, Jiang Qian; Miyagi, Toshihiko // Transportation Science;May2001, Vol. 35 Issue 2, p1 

    Recently, extensive studies have been conducted on the computational methods of sensitivity analysis for the Wardropian equilibrium modeling of traffic networks and their applications. But the same problems in the context of the stochastic user equilibrium modeling seem not to have been...

  • Dynamic traffic assignment: Considerations on some deterministic modelling approaches. Codina, E.; Barcel´┐Ż, J. // Annals of Operations Research;1995, Vol. 60 Issue 1-4, p1 

    Research on how to model the dynamic behaviour of traffic flows efficiently and the development of algorithms to handle such models numerically has become a key activity in recent years as a consequence of the emerging applications of advanced technologies to transport. This paper offers a...

  • A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium. Smith, M. J.; Wisten, M. B. // Annals of Operations Research;1995, Vol. 60 Issue 1-4, p59 

    Suppose that a road network model is given, together with some given demand for travel by (say) car and that the demand for travel varies with time of day but not from day to day. Suppose that this demand is given in the form of specified total outflow rates from each origin headed towards each...

  • Locating flow-intercepting facilities: New approaches and results. Berman, Oded; Krass, Dmitry; Chen Wei Xu // Annals of Operations Research;1995, Vol. 60 Issue 1-4, p121 

    The problem of locating flow-intercepting facilities on a network with probabilistic customer flows and with facility set-up costs is studied in this paper. Two types of models are investigated, namely the double-counting model and the no-double-counting model (double-counting refers to multiple...

  • Analysis of Dynamic Traffic Equilibrium with Departure Time Choice. Heydecker, B. G.; Addison, J. D. // Transportation Science;Feb2005, Vol. 39 Issue 1, p39 

    We present and analyse a model of the combined choice of departure time and route in a congested road network. Using the property of equilibrium solutions that for each origin-destination pair the total cost associated with travel is identical for all travellers, we establish a general result...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics