Real-Time Dynamic Origin-Destination Matrix Adjustment with Simulated and Actual Link Flows in Urban Networks

Tsekeris, T; Stathopoulos, A

dc.contributor.author	Tsekeris, T	en
dc.contributor.author	Stathopoulos, A	en
dc.date.accessioned	2014-03-01T02:42:20Z
dc.date.available	2014-03-01T02:42:20Z
dc.date.issued	2003	en
dc.identifier.issn	0361-1981	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30947
dc.subject	Origin Destination	en
dc.subject.classification	Engineering, Civil	en
dc.subject.classification	Transportation	en
dc.subject.classification	Transportation Science & Technology	en
dc.subject.other	Algorithms	en
dc.subject.other	Computer simulation	en
dc.subject.other	Convergence of numerical methods	en
dc.subject.other	Costs	en
dc.subject.other	Highway systems	en
dc.subject.other	Intersections	en
dc.subject.other	Mathematical models	en
dc.subject.other	Mathematical programming	en
dc.subject.other	Matrix algebra	en
dc.subject.other	Optimal control systems	en
dc.subject.other	Problem solving	en
dc.subject.other	Real time systems	en
dc.subject.other	Robustness (control systems)	en
dc.subject.other	Set theory	en
dc.subject.other	Traffic control	en
dc.subject.other	Urban planning	en
dc.subject.other	Dynamic transfer assignment (DTA)	en
dc.subject.other	Link flows	en
dc.subject.other	Optimal control theory	en
dc.subject.other	Origin-destination (O-D) trip matrix	en
dc.subject.other	Highway administration	en
dc.title	Real-Time Dynamic Origin-Destination Matrix Adjustment with Simulated and Actual Link Flows in Urban Networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.3141/1857-14	en
heal.identifier.secondary	http://dx.doi.org/10.3141/1857-14	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	The efficiency and robustness of different real-time dynamic origin-destination (O-D) matrix adjustment algorithms were investigated when implemented in large-scale transportation networks. The proposed algorithms produce time-dependent O-D trip matrices based on the maximum-entropy trip departure times with simulated and actual observed link flows. Implementation of the algorithms, which are coupled with a quasi-dynamic traffic assignment model, indicated their convergent behavior and their potential for handling realistic urban-scale network problems in terms of both accuracy and computational time. The main factors influencing the numerical performance of each algorithm were identified and analyzed. Their relative efficiency was found to be particularly dependent on the level at which the assigned flows approximate the observed link flows. These results may provide insights into the suitability of each algorithm for diverse application domains, including freeways, small networks, and large-scale urban networks, where a different quality of O-D information is usually available.	en
heal.publisher	TRANSPORTATION RESEARCH BOARD NATL RESEARCH COUNCIL	en
heal.journalName	Transportation Research Record	en
heal.bookName	TRANSPORTATION RESEARCH RECORD	en
dc.identifier.doi	10.3141/1857-14	en
dc.identifier.isi	ISI:000189433000014	en
dc.identifier.issue	1857	en
dc.identifier.spage	117	en
dc.identifier.epage	127	en