Journal
TRANSPORTMETRICA B-TRANSPORT DYNAMICS
Volume 7, Issue 1, Pages 1013-1043Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/21680566.2018.1540952
Keywords
Policy-based network loading; chronological network loading; link transmission model; traffic assignment; suboptimal policies
Funding
- Division of Civil, Mechanical and Manufacturing Innovation [1520338]
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [1520338] Funding Source: National Science Foundation
Ask authors/readers for more resources
Non-recurrent congestion is a major problem in traffic networks that causes unexpected delays during travels. In such a scenario, it is preferable to use adaptive paths or policies where next link decisions on reaching junctions are continuously adapted based on the information gained with time. In this paper, we study a traffic assignment problem in stochastic time-dependent networks. The problem is modeled as a fixed-point problem and existence of the equilibrium solution is discussed. We iteratively solve the problem using the method of successive averages (MSA). A novel network loading model inspired from Link transmission model is developed that accepts policies as inputs for solving the problem. This network loading model is different from the existing network loading models that take predefined paths for input flows. We demonstrate through numerical tests that solving traffic assignment problem with the proposed loading modeling scheme is more efficient as compared to solving the problem using path-based network loading models.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available