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
- Huijun Sun (ORCID: https://orcid.org/0000-0002-3989-7391)
- Hao Fu (ORCID: https://orcid.org/0000-0003-0653-3134)
- William H. K. Lam (ORCID: https://orcid.org/0000-0002-7625-3712)
- Yuxin Shi (ORCID: https://orcid.org/0009-0007-8010-9207)
- Ziyou Gao (ORCID: https://orcid.org/0000-0002-9575-6905)
- Wei Ma (ORCID: https://orcid.org/0000-0001-8945-5877)
- Rui Jiang
Institutions
- Hong Kong Polytechnic University (HK)
- Beijing Jiaotong University (CN)
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
- National Natural Science Foundation of China
- Hong Kong Polytechnic University
- Chinese University of Hong Kong