Computational framework for the estimation of dynamic OD trip matrices

Origin-Destination (OD) trip matrices describe traffic behavior patterns across the network and play a key role as primary data input to many traffic models. OD matrices are a critical requirement, in traffic assignment models, static or dynamic. However, OD matrices are not yet directly observable;...

Descripción completa

Detalles Bibliográficos
Autores: Barceló Bugeda, Jaime|||0000-0001-6195-6434, Montero Mercadé, Lídia|||0000-0001-5722-138X
Tipo de recurso: informe técnico
Fecha de publicación:2015
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/80834
Acceso en línea:https://hdl.handle.net/2117/80834
Access Level:acceso abierto
Palabra clave:Dynamic OD Matrices
Matrix Estimation
Bi-level Optimization
Kalman filtering
ICT data
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Optimització
Descripción
Sumario:Origin-Destination (OD) trip matrices describe traffic behavior patterns across the network and play a key role as primary data input to many traffic models. OD matrices are a critical requirement, in traffic assignment models, static or dynamic. However, OD matrices are not yet directly observable; thus, the current practice consists of adjusting an initial a priori matrix from link flow counts, speeds, travel times and other aggregate demand data, supplied by a layout of traffic counting stations. The availability of new traffic measurements from ICT applications offers the possibility to formulate and develop more efficient algorithms, especially suited for real-time applications. This work proposes an integrated computational framework in which an off-line procedure generates the time-sliced OD matrices, which are the input to an on-line estimator, whose sensitivity with respect to the available traffic measurements is analyzed.