Citation

Etemadnia H, Abdelghany KF. Transp. Plann. Tech. 2011; 34(3): 217-230.

Copyright

(Copyright © 2011, Informa - Taylor and Francis Group)

DOI

10.1080/03081060.2011.565169

PMID

unavailable

Abstract

This paper describes a distributed recursive heuristic approach for the origin?destination demand estimation problem for real-time traffic network management applications. The distributed nature of the heuristic enables its parallelization and hence reduces significantly its processing time. Furthermore, the heuristic reduces dependency on historical data that are typically used to map the observed link flows to their corresponding origin?destination pairs. In addition, the heuristic allows the incorporation of any available partial information on the demand distribution in the study area to improve the overall estimation accuracy. The heuristic is implemented following a hierarchal multi-threading mechanism. Dividing the study area into a set of subareas, the demand of every two adjacent subareas is merged in a separate thread. The merging operations continue until the demand for the entire study area is estimated. Experiments are conducted to examine the performance of the heuristic using hypothetical and real networks. The obtained results illustrate that the heuristic can achieve reasonable demand estimation accuracy while maintaining superiority in terms of processing time.