Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem

• Propose a new static traffic assignment model considering residual queue for a congested network;. • Ensure that the assigned link flows are less than or equal to the link physical capacity and coincide with the observed flows;. • Propose a generalized link cost function with a queue-dependent capacity;. • Develop a gradient projection – alternating minimization algorithm to solve the 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.

Authors

Institutions

Publication Details

Journal
Transportation Research Part B Methodological
Published
2025-01-29
DOI
https://doi.org/10.1016/j.trb.2025.103158
Citations
9
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
20.56

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem

Huijun Sun, Hao Fu, William H. K. Lam, Yuxin Shi et al.
9 citations
Transportation Research Part B Methodological
Advanced Queuing Theory Analysis
20.56
article

Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem

Huijun Sun, Hao Fu, William H. K. Lam, Yuxin Shi, Ziyou Gao, Wei Ma, Rui Jiang
article en
9 citations

Abstract

• Propose a new static traffic assignment model considering residual queue for a congested network;. • Ensure that the assigned link flows are less than or equal to the link physical capacity and coincide with the observed flows;. • Propose a generalized link cost function with a queue-dependent capacity;. • Develop a gradient projection – alternating minimization algorithm to solve the 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.

Transportation Research Part B MethodologicalVol. 192
Hong Kong Polytechnic University (HK), Beijing Jiaotong University (CN)
National Natural Science Foundation of China, Hong Kong Polytechnic University, Chinese University of Hong Kong
Openalex Percentile: Top 1%
Advanced Queuing Theory Analysis
20.56
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.