Wardrop’s User Equilibrium Assignment under Stochastic Environment

نویسندگان

  • Chao Zhang
  • Xiaojun Chen
  • Agachai Sumalee
چکیده

Various models of traffic assignment under stochastic environment have been proposed recently, mainly by assuming different travelers’ behavior against uncertainties. This paper focuses on the expected residual minimization (ERM) model to provide a robust traffic assignment with an emphasis on the planner’s perspective. The model is further extended to obtain a stochastic prediction of the traffic volumes by the technique of path choice approach. We show theoretically the existence and the robustness of the ERM solution. In addition, we employ an improved solution algorithm for solving the ERM model. Numerical experiments are carried out to illustrate the characteristics of the proposed model, by comparing with other existing models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

متن کامل

Bi-Objective Network Equilibrium, Traffic Assignment and Road Pricing

Multi-objective equilibrium models of traffic assignment state that users of road networks travel on routes that are efficient with respect to several objectives, such as travel time and toll. This concept provides a general framework for modelling traffic flow in tolled road networks. We present the concept of time surplus maximisation as a way of handling user preferences. Given a toll, users...

متن کامل

The combined distribution and stochastic assignmentproblem Jan

The combined distribution and assignment problem is the problem of the simultaneous determination of the distribution of trips between origins and destinations in a transportation network and the assignment of trips to routes in each origin{ destination pair. In the model most widely used the distribution is assumed to follow a gravity model with negative exponential deterrence function and the...

متن کامل

Projection and Fukushima’s Gap Based Methods for the Asymmetric Traffic Assignment Problem

Traffic Assignment is the problem of assigning an Origin to Destination, OD matrix onto a network, under given conditions of using the links of the network, to determine the resulting traffic flows in the network. The underlying hypothesis is that travelers travel from origins to destinations in the network along the available routes connecting them. The characteristics of a traffic assignment ...

متن کامل

On Calibration and Application of Logit-Based Stochastic Traffic Assignment Models

There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009