Analysis of Dynamic Traffic Equilibrium with Departure Time Choice

Heydecker, B. G.; Addison, J. D.
February 2005
Transportation Science;Feb2005, Vol. 39 Issue 1, p39
Academic Journal
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 that elates assignments to various components of cost. The analysis is developed to include time-varying tolls and to establish a formula that will induce any specified in flow profile as an equilibrium. We introduce an iteration operator to calculate equilibrium in flow profiles, and present the results of example calculations for a range of test problems.


Related Articles

  • 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...

  • On Stochastic Models of Traffic Assignment. Daganzo, Carlos F.; Sheffi, Yosef // Transportation Science;Aug77, Vol. 11 Issue 3, p253 

    This paper contains a quantitative evaluation of probabilistic traffic assignment models and proposes an alternate formulation. First, the concept of stochastic-user-equilibration (S-U-E) is formalized as an extension of Wardrop's user-equilibration criterion. Then, the...

  • 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...

  • 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...

  • Dynamic user optimal of traffic assignment based on optimal signal timing. Lu Zhang // Applied Mechanics & Materials;2014, Issue 587-589, p2040 

    At the beginning the paper summarizes the research status, models and algorithms of dynamic traffic assignment and analyzes the relationship between dynamic user optimal model and variational inequality. Secondly, a dynamic user optimal model of traffic assignment based on optimal signal timing...

  • 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...

  • Origin-Based Algorithm for the Traffic Assignment Problem. Bar-Gera, Hillel // Transportation Science;Nov2002, Vol. 36 Issue 4, p398 

    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...

  • 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...

  • The emergence of hierarchy in transportation networks. Yerra, Bhanu; Levinson, David // Annals of Regional Science;Sep2005, Vol. 39 Issue 3, p541 

    A transportation network is a complex system that exhibits the properties of self-organization and emergence. Previous research in dynamics related to transportation networks focuses on traffic assignment or traffic management. This research concentrates on the dynamics of the orientation of...


Read the Article


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

Try another library?
Sign out of this library

Other Topics