Analytical Formulation of the Trip Travel Time Distribution
This paper validates an analytical and tractable approximation of trip travel time variance for general topology networks. The main challenge in the derivation of such an approximation is to account for spatial between-link dependencies in an analytical yet also tractable manner. The approximation c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Elsevier BV
2018
|
| Online Access: | http://hdl.handle.net/1721.1/117429 https://orcid.org/0000-0003-0979-6052 |
| Summary: | This paper validates an analytical and tractable approximation of trip travel time variance for general topology networks. The main challenge in the derivation of such an approximation is to account for spatial between-link dependencies in an analytical yet also tractable manner. The approximation considered in this paper achieves tractability by extending Little's law for higher-order moments of finite capacity Markovian queueing networks. This paper presents a detailed validation of this approach. We compare the analytical approximations of path travel time variance to simulation-based estimates for two general topology queueing networks. Ongoing work, to be presented at the conference, uses this approach to address an urban traffic signal control problem that explicitly accounts travel time variability. Keywords: Little's law; spillback; path travel time. |
|---|