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%.
Type de document :
Article dans une revue
Transportation research. Part C, Emerging technologies, Elsevier, 2018, 95, pp.713-730. 〈10.1016/j.trc.2018.07.033〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01953560
Contributeur : Giacomo Casadei <>
Soumis le : jeudi 13 décembre 2018 - 10:12:40
Dernière modification le : vendredi 4 janvier 2019 - 23:03:30

Fichier

elsarticle-template-harv.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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〉

Partager

Métriques

Consultations de la notice

46

Téléchargements de fichiers

39