Aggregation and travel time calculation over large scale traffic networks: An empiric study on the Grenoble City

Giacomo Casadei 1 V. Bertrand 1 B. Gouin 1 Carlos Canudas de Wit 1
1 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
Abstract : In this paper we consider aggregation technique to reduce the complexity of large-scale traffic network. In particular, we consider the city of Grenoble and show that, by clustering adjacent sections based on a similarity of speed condition, it is possible to cut down the complexity of the network without loosing crucial and intrinsic information. To this end, we consider travel time computation as a metric of comparison between the original graph and the reduced one: for each cluster we define four attributes (average speed, primary and secondary length and heading) and show that, in case of an aggregation rate of 95%, these attributes are sufficient in order to maintain the travel time error below the 25%.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01953560
Contributor : Giacomo Casadei <>
Submitted on : Thursday, December 13, 2018 - 10:12:40 AM
Last modification on : Friday, January 4, 2019 - 11:03:30 PM
Document(s) archivé(s) le : Thursday, March 14, 2019 - 12:54:12 PM

File

elsarticle-template-harv.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Giacomo Casadei, V. Bertrand, B. Gouin, Carlos Canudas de Wit. Aggregation and travel time calculation over large scale traffic networks: An empiric study on the Grenoble City. Transportation research. Part C, Emerging technologies, Elsevier, 2018, 95, pp.713-730. ⟨10.1016/j.trc.2018.07.033⟩. ⟨hal-01953560⟩

Share

Metrics

Record views

59

Files downloads

68