A FIFO Rule Consistent Model for the Continuous Dynamic Network Loading Problem

被引:12
|
作者
Castillo, Enrique [1 ]
Menendez, Jose Maria [2 ]
Nogal, Maria [1 ]
Jimenez, Pilar [2 ]
Sanchez-Cambronero, Santos [2 ]
机构
[1] Univ Cantabria, Dept Dept Appl Math & Computat Sci, E-39005 Santander, Spain
[2] Univ Castilla La Mancha, Dept Civil Engn, E-13071 Ciudad Real, Spain
关键词
Congestion; dynamic traffic model; iterative processes; network loading problem; traffic wave propagation; VARIATIONAL INEQUALITY FORMULATION; CELL TRANSMISSION MODEL; KINEMATIC WAVES; TRAFFIC FLOW; OBSERVABILITY PROBLEM; TRAVEL-TIME; EXISTENCE; MATRIX;
D O I
10.1109/TITS.2011.2169668
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
This paper presents a first-in-first-out (FIFO) rule consistent model for the continuous dynamic network loading problem. The model calculates the link travel time functions at a basic finite set of equally spaced times that are used to interpolate a monotone spline for all the other times. The model assumes a nonlinear link travel time function of the link volumes, but some corrections are made to satisfy the FIFO rule at the basic set. Furthermore, the use of monotone cubic splines preserving monotonicity guarantees that the FIFO rule is satisfied at all points. The model consists of five units: 1) a path origin flow wave definition unit; 2) a path wave propagation unit; 3) a congestion analysis unit; 4) a network flow propagation unit; and 5) an inference engine unit. The path flow intensity wave, which is the basic information, is modeled as a linear combination of basic waves. Next, the individual path waves are propagated throughout the paths by using a conservation equation that stretches or enlarges the wave lengths and increases or reduces the wave heights, depending on the degree of congestion at different links. Then, the individual path waves are combined together to generate the link and node waves. Finally, the inference engine unit combines all information items to make them compatible in times and locations using the aforementioned iterative method until convergence. The method is illustrated by some examples. The results seem to reproduce the observed trends closely. The required CPU times oscillated between seconds and a few minutes.
引用
收藏
页码:264 / 283
页数:20
相关论文
共 50 条
  • [1] Advances in the continuous dynamic network loading problem
    Xu, YW
    Wu, JH
    Florian, M
    Marcotte, P
    Zhu, DL
    [J]. TRANSPORTATION SCIENCE, 1999, 33 (04) : 341 - 353
  • [2] A Model for Continuous Dynamic Network Loading Problem with Different Overtaking Class Users
    Castillo, Enrique
    Nogal, Maria
    Calvino, Aida
    Rivas, Ana
    Lo, Hong K.
    [J]. JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2013, 17 (04) : 328 - 350
  • [3] The continuous dynamic network loading problem: A mathematical formulation and solution method
    Wu, JH
    Chen, Y
    Florian, M
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1998, 32 (03) : 173 - 187
  • [4] Two improved numerical algorithms for the continuous dynamic network loading problem
    Rubio-Ardanaz, JM
    Wu, JH
    Florian, M
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (02) : 171 - 190
  • [5] A Node-Based Modeling Approach for the Continuous Dynamic Network Loading Problem
    Celikoglu, Hilmi Berk
    Gedizlioglu, Ergun
    Dell'Orco, Mauro
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2009, 10 (01) : 165 - 174
  • [6] Consistent node arrival order in dynamic network loading models
    Blumberg, Michal
    Bar-Gera, Hillel
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2009, 43 (03) : 285 - 300
  • [7] Three approaches to the dynamic network loading problem
    Er-Rafia, K
    Florian, M
    Mahut, M
    Velan, S
    [J]. 2001 IEEE INTELLIGENT TRANSPORTATION SYSTEMS - PROCEEDINGS, 2001, : 127 - 131
  • [8] The robust network loading problem with dynamic routing
    Mattia, Sara
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 54 (03) : 619 - 643
  • [9] The robust network loading problem with dynamic routing
    Sara Mattia
    [J]. Computational Optimization and Applications, 2013, 54 : 619 - 643
  • [10] A Monte Carlo Approach to Simulate the Stochastic Demand in a Continuous Dynamic Traffic Network Loading Problem
    Teresa Sanchez-Rico, Maria
    Garcia-Rodenas, Ricardo
    Luis Espinosa-Aranda, Jose
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2014, 15 (03) : 1362 - 1373