Continuous and discrete trajectory models for dynamic traffic assignment.

*(English)*Zbl 1081.90007Summary: A continuous trajectory model is presented in which transportation networks are represented as topological constructs. The general formulation enhances existing analytic dynamic traffic assignment models by incorporating continuous single-link traffic flow models in a general, coherent, and relatively intuitive manner. Specific exact formulation based on a simplified kinematic wave traffic flow model with physical queues is presented as well.

A discrete trajectory model is proposed as an approximation of the continuous model. The discrete model provides wide flexibility in choosing the level of aggregation with respect to time intervals, ranging from several hours, as typical in current practice of long-term travel forecasting models, to one second or less, as in microscopic simulations. An algorithm to find discrete approximate solutions is presented as well as accuracy measures to evaluate them. The effect of time resolution on model performance is examined by a numerical example.

A discrete trajectory model is proposed as an approximation of the continuous model. The discrete model provides wide flexibility in choosing the level of aggregation with respect to time intervals, ranging from several hours, as typical in current practice of long-term travel forecasting models, to one second or less, as in microscopic simulations. An algorithm to find discrete approximate solutions is presented as well as accuracy measures to evaluate them. The effect of time resolution on model performance is examined by a numerical example.

##### MSC:

90B06 | Transportation, logistics and supply chain management |

90B10 | Deterministic network models in operations research |

90B20 | Traffic problems in operations research |

##### Keywords:

Dynamic traffic assignment; network-loading; continuous trajectory models; trajectory discretization
Full Text:
DOI

##### References:

[1] | Boyce, W.E. and R.C. DiPrima. (1992). Elementary Differential Equations, 5th edition. New-York: John Wiley & Sons. · Zbl 0807.34002 |

[2] | Carey, M. (2001). ?Dynamic Traffic Assignment with More Flexible Modelling Within Links.? Networks and Spatial Economics 1, 349-375. · doi:10.1023/A:1012848329399 |

[3] | Daganzo, C.F. (1994). ?The Cell Transmission Model: A Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory.? Transportation Research 28B, 269-287. |

[4] | Daganzo, C.F. (1995a). ?The Cell Transmission Model, Part II: Network Traffic.? Transportation Research 29B, 79-93. |

[5] | Daganzo, C.F. (1995b). ?Properties of Link Travel Time Functions Under Dynamic Loads.? Transportation Research 29B, 95-98. |

[6] | Friesz, L.T., D. Bernstein, T.E. Smith, R.L. Tobin, and B.W. Wie. (1993). ?A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem.? Operations Research 41, 179-191. · Zbl 0771.90037 · doi:10.1287/opre.41.1.179 |

[7] | Friesz, L.T., D. Bernstein, Z. Suo, and R.L. Tobin. (2001). ?Dynamic Network User Equilibrium with State-Dependent Time Lags.? Networks and Spatial Economics 1, 319-347. · doi:10.1023/A:1012896228490 |

[8] | Jayakrishnan, R., H.S. Mahmassani, and T.Y. Hu. (1994). ?An Evaluation Tool for Advanced Traffic Information and Management Systems in Urban Networks.? Transportation Research 3C, 129-147. |

[9] | Kuhne, R. and P. Michalopoulos. (1992). ?Continuum Flow Models.? Chapter 5 in Traffic Flow Theory?-A State-of-the-Art Report, ORNL & TRB. |

[10] | Kuwahara, M. and T. Akamatsu. (2001). ?Dynamic User Optimal Assignment with Physical Queues for Many-to-Many OD Pattern.? Transportation Research 35B, 461-479. |

[11] | Lighthill, J.M. and J.B. Whitham. (1955). ?On Kinematic Waves: II, A Theory of Traffic Flow in Long Crowded Roads.? Proceedings of the Royal Society 229A, 316-345. · Zbl 0064.20906 |

[12] | Lo, H.K. and W.Y. Szeto. (2002). ?A Cell-Based Variational Inequality Formulation of the Dynamic User Optimal Assignment Problem.? Transportation Research 36B, 421-443. |

[13] | Mahut, M. (2000). ?A Discrete Flow Model for Dynamic Network Loading.? Ph.D. thesis, Departement d?informatique et recherche operationnelle, Universite de Montreal, Canada. |

[14] | Newell, G.F. (1993a). ?A Simplified Theory of Kinematic Waves in Highway Traffic, Part I: General Theory.? Transportation Research 27B, 281-287. |

[15] | Newell, G.F. (1993b). ?A Simplified Theory of Kinematic Waves in Highway Traffic, Part II: Queuing at Freeway Bottlenecks.? Transportation Research 27B, 289-303. |

[16] | Newell, G.F. (1993c). ?A Simplified Theory of Kinematic Waves in Highway Traffic, Part III: Multi-Destination Flows.? Transportation Research 27B, 305-313. |

[17] | Ran, B. and D. Boyce. (1996). Modeling Dynamic Transportation Networks, 2nd edition. Berlin: Springer-Verlag. · Zbl 0898.90004 |

[18] | Richards, P.I. (1956). ?Shock Waves on the Highways.? Operations Research 4, 42-51. · doi:10.1287/opre.4.1.42 |

[19] | Wu, J.H., Y. Chen, and M. Florian. (1998). ?The Continuous Dynamic Network Loading Problem: A Mathematical Formulation and Solution Method.? Transportation Research 32B, 173-187. |

[20] | Xu, Y.W., J.H. Wu, M. Florian, P. Marcote, and D.L. Zhu. (1999). ?Advances in the Continuous Dynamic Network Loading Problem.? Transportation Science 33, 341-353. · Zbl 0958.90005 · doi:10.1287/trsc.33.4.341 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.