Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem
The residual queue during a given study period (e.g., peak hour) is an important feature that should be considered when solving a traffic assignment problem under equilibrium for strategic traffic planning. Although studies have focused extensively on static or quasi-dynamic traffic assignment models considering the residual queue, they have failed to capture the situation wherein the equilibrium link flow passing through the link is less than the link physical capacity under congested conditions. To address this critical issue, we introduce a novel static traffic assignment model that explicitly incorporates the residual queue and queue-dependent link capacity. The proposed model ensures that equilibrium link flows remain within the physical capacity bounds, yielding estimations more aligned with data observed by traffic detectors, especially in oversaturated scenarios. A generalized link cost function considering queue-dependent capacity, with an additional queuing delay term is proposed. The queuing delay term represents the added travel cost under congestion, offering a framework wherein conventional static models, both with and without physical capacity constraints, become special cases of our model. Our study rigorously analyzes the mathematical properties of the new model, establishing the theoretical uniqueness of solutions for link flow and residual queue under certain conditions. We also introduce a gradient projection-based alternating minimization algorithm tailored for the proposed model. Numerical examples are conducted to demonstrate the superiority and merit of the proposed model and solution algorithm.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Minimizing Queue Length Regret for Arbitrarily Varying Channels
We consider an online channel scheduling problem for a single transmitter-receiver pair equipped with $N$ arbitrarily varying wireless channels. The transmission rates of the channels might be non-stationary and could be…
SchedulingA Control Theoretic Approach to Simultaneously Estimate Average Value of Time and Determine Dynamic Price for High-occupancy Toll Lanes
The dynamic pricing problem of a freeway corridor with high-occupancy toll (HOT) lanes was formulated and solved based on a point queue abstraction of the traffic system [Yin and Lou, 2009]. However, existing pricing str…
Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds
We study finite-horizon queue peaks in generalized switches, a standard stochastic-network model in which many queues share constrained service resources. Arrivals may be dependent, nonstationary, and responsive to the s…
Parallel Execution Fee Mechanisms
This paper investigates how pricing schemes can achieve efficient allocations in blockchain systems featuring multiple transaction queues under a global capacity constraint. I model a capacity-constrained blockchain wher…
To build or not to build -- A queueing-based approach to timetable independent railway junction infrastructure dimensioning
Many infrastructure managers have the goal to increase the capacity of their railway infrastructure due to an increasing demand. While methods for performance calculations of railway line infrastructure are already well …