Effectiveness of link and path information on simultaneous adjustment of dynamic O-D demand matrix

European Transport Research Review

Original Paper

Ernesto Cipriani¹  Marialisa Nigro¹  Chiara Colombaroni²  Gaetano Fusco² 

[1] Department of Engineering, Roma Tre University, Via Vito Volterra 62, 00146 Rome, Italy;Research Centre for Transport and Logistics, University of Rome “La Sapienza”, Rome, Italy;

关键词: Demand adjustment;    Dynamic assignment;    Probe data;    SPSA algorithm;   

DOI  :  10.1007/s12544-013-0115-z

 received in 2011-11-25, accepted in 2013-07-30,  发布年份 2013

来源: Springer

【 摘 要 】

IntroductionThe paper deals with the adjustment of time-dependent Origin–destination (O-D) demand matrix, which is the fundamental input of ITS application for traffic predictions. The usual problem is to search for temporal O-D matrices that are “near” an a priori estimate (seed matrices) and that best fit traffic counts. However information on link flows is not fully effective in describing the state of the network; recent technologies for tracking vehicles provide a new kind of information on route travel times that can integrate usual information on traffic flows at count sections.ObjectiveThe object of the paper is to analyse the effectiveness of different types of information in the off-line simultaneous adjustment of dynamic O-D demand, starting from seed matrices with different degrees of reliability.

【 授权许可】

Unknown   
© The Author(s) 2013