TITLE

Sensitivity Analysis for Stochastic User Equilibrium Network Flows - A Dual Approach

AUTHOR(S)
Ying, Jiang Qian; Miyagi, Toshihiko
PUB. DATE
May 2001
SOURCE
Transportation Science;May2001, Vol. 35 Issue 2, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
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 addressed. In this paper, we present a method for sensitivity analysis for network flows at stochastic user equilibrium. Our method is developed from a dual formulation of the stochastic user equilibrium analysis. By adopting Dial's algorithm for stochastic traffic assignment, we are able to formulate a computationally efficient link-based algorithm for the sensitivity analysis. Since the Wardropian equilibrium in a traffic network is an extreme case of stochastic user equilibrium with θ → ∞, θ being a dispersion parameter in the expected utility function for stochastic route choice, the method presented here can also be used for sensitivity analysis of the Wardropian equilibrium by setting θ large enough.
ACCESSION #
5649398

 

Related Articles

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

  • The Estimation of an Origin-Destination Matrix form Traffic Counts. Bell, M. G. H. // Transportation Science;May83, Vol. 17 Issue 2, p198 

    In this paper, a model is described that will under certain circumstances yield the most likely origin-destination matrix which is consistent with measurements of link traffic volumes. Given knowledge of the proportionate usage of each link by the traffic between each zone pair, the model...

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

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

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

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics