A path marginal cost approximation algorithm for system optimal quasi-dynamic traffic assignment

نویسندگان
چکیده

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

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

منابع مشابه

A Path Enumeration Algorithm for Strategic System Optimal Dynamic Traffic Assignment

Accounting for sources of uncertainty in the Dynamic Traffic Assignment (DTA) problem makes an already complex problem even more difficult. This work examines a Strategic System Optimal DTA (StrSODTA) model where optimal path proportions are assigned to minimize the Total System Travel Time (TSTT) across a range of stochastic demand scenarios. However, the LP proposed by Waller et al. (2013) fa...

متن کامل

A Simulation-based Approximation Algorithm for Dynamic Marginal Cost Pricing

This work offers a simulation-based approximation algorithm for dynamic marginal cost pricing (MCP) that is a direct extension of static MCP. The algorithm approximates the time-dependent marginal costs, and is incorporated into the inner approximation dynamic user equilibrium algorithm to evaluate the results of dynamic MCP, which are then compared to static assignment results with MCP from pr...

متن کامل

Marginal Cost Pricing for System Optimal Traffic Assignment with Recourse under Supply-Side Uncertainty

Transportation networks are often subject to fluctuations in supply-side parameters such as capacity and free-flow travel time due to factors such as incidents, poor weather, and bottlenecks. In such scenarios, assuming that network arcs exist in a finite number of states with different delay functions with different probabilities, a marginal cost pricing scheme that leads to a socially optimal...

متن کامل

Dynamic System-optimal Traffic Assignment Using a State Space Model’

Abstract-We propose a new mathematical formulation for the problem of optimal traffic assignment in dynamic networks with multiple origins and destinations. This problem is motivated by route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment. We assume that the network is subject to known time-varying demands for travel between its origins and destinations ...

متن کامل

Modeling Road Traffic Congestion by Quasi-Dynamic Traffic Assignment

The paper deals with simulation of congested road networks through dynamic traffic assignment models and presents a new quasi-dynamic traffic assignment model that improves realism and effectiveness of both usual static traffic assignment models and other quasi-dynamic models recently introduced in the literature, as it simulates flow progression onto the network by moving link flows according ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Transportation Research Part C: Emerging Technologies

سال: 2018

ISSN: 0968-090X

DOI: 10.1016/j.trc.2018.01.002