A Path-Based Algorithm for the Cross-Nested Logit Stochastic User Equilibrium Traffic Assignment

نویسندگان

  • Shlomo Bekhor
  • Tomer Toledo
  • Lena Reznikova
چکیده

This paper investigates the single-class static stochastic user equilibrium (SUE) problem with separable and additive link costs. A SUE assignment based on the Cross-Nested Logit (CNL) route choice model is presented. The CNL model can better represent route choice behavior compared to the Multinomial Logit (MNL) model, while keeping a closed form equation. The paper uses a specific optimization formulation developed for the CNL model, and develops a path-based algorithm for the solution of the CNL-SUE problem based on adaptation of the disaggregate simplicial decomposition (DSD) method. The paper illustrates the algorithmic implementation on a real size network and discusses the trade-offs between MNL-SUE and CNL-SUE assignment.

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

ثبت نام

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

منابع مشابه

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

متن کامل

Decomposition of Path Choice Entropy in General Transport Networks

This paper shows that the LOGIT type stochastic assignment / stochastic user equilibrium assignment can be represented as an optimization problem with only link variables. The conventional entropy function defined by path flows in the objective can be decomposed into a function consisting only of link flows. The idea of the decomposed formulation is derived from a consideration ofthe most likel...

متن کامل

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

متن کامل

Probit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach

Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...

متن کامل

Upper Bounds on Inefficiency of Taxed Stackelberg Network with Cross- Nested Logit Assignment

Upper bound of efficiency loss is a valuable issue for transport network design and planning. This paper initially explores it in a taxed stochastic traffic network whose equilibrium flow pattern is deduced by a cross-nested Logit (CNL) flow assignment model, and a centrally controlling Stackelberg strategy. With the assumptions of separability, nondecreasingness, and convexity of the link time...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Comp.-Aided Civil and Infrastruct. Engineering

دوره 24  شماره 

صفحات  -

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