Publication Cover
Journal of Intelligent Transportation Systems
Technology, Planning, and Operations
Volume 22, 2018 - Issue 2
239
Views
9
CrossRef citations to date
0
Altmetric
SPECIAL SECTION: ADVANCES IN TRAVEL TIME RELIABILITY MONITORING AND ASSESSMENT

Reliability-based network flow estimation with day-to-day variation: A model validation on real large-scale urban networks

, & ORCID Icon
Pages 121-143 | Received 27 Sep 2015, Accepted 02 Dec 2017, Published online: 29 Dec 2017
 

ABSTRACT

Day-to-day variation in the travel times of congested urban transportation networks is a frustrating phenomenon to the users of these networks. These users look pessimistically at the path travel times, and learn to spend additional time to safeguard against serious penalties that await late arrivals at the destinations. These additional expenses are charges similar to the tolls in system equilibrium flow problem, but may not be collected. With this conjecture, the user equilibrium (UE) formulation of congested network flow problem would lack some necessary factors in addressing appropriate path choices. This study, following a previous work proposing pessimistic UE (PUE) flow, aims to show how to measure this additional travel cost for a link, and investigates how different is PUE from UE, and when such differences are pronounced. Data are collected from the peak-hour travel times for the links of paths in the city of Tehran, to estimate the variance of travel times for typical links. Deterministic functions are obtained by calibrating the standard deviation of the daily variations of link travel times, and probabilistic functions by the technique of copula. UE and PUE traffic assignment models are built and applied to three large cities of Mashhad, Shiraz, and Tehran in Iran. The results show that the estimated flows by PUE model replicate the observed flows in screen lines much better than the UE model, particularly for longer trips. Since PUE is computationally equivalent to UE, this improvement is attained virtually at no cost.

Acknowledgments

The authors wish to thank Prof. H. Z. Aashtiani, of Sharif University of Technology, for his helpful comments, and Dr. A. Babazadeh of Tehran University, and Ms. M. Zakeri Sohi, for their help in running some of the computer programs. They also appreciate the insightful comments by the anonymous reviewers, very much, that enhanced the content and presentation of the article appreciably. The authors, however, remain solely responsible for the content of this article.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 419.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.