Print Email Facebook Twitter Heuristic Coarsening for Generating Multiscale Transport Networks Title Heuristic Coarsening for Generating Multiscale Transport Networks Author Krishnakumari, P.K. (TU Delft Transport and Planning) Cats, O. (TU Delft Transport and Planning) van Lint, J.W.C. (TU Delft Transport and Planning) Date 2019 Abstract Graphs at different scales are essential tools for many transportation applications. Notwithstanding their relevance, these graphs are created and maintained manually for most applications, in both research and practice. In this paper, we develop a heuristic method for automatically generating multiscale graph representations without significantly compromising their topological properties. This makes the resulting graphs widely applicable. The method is demonstrated on the open street map network of Amsterdam with four different application cases. Various graph metrics are used for evaluating the performance of coarsening on the topological characteristics of the network. Our results show that the method is able to successfully reduce the Amsterdam network by up to 96% of its original size at a computation time of no more than 15 min with a limited loss of information, indicated by the preservation of key network characteristics. For example, the method maintains trip length distributions and limits the maximum shortest path deterioration between any major origin and destination nodes to no more than 0.025% for the coarsest graph. Moreover, by setting its parameters it can cater for preservation of important network elements or entire sub-networks, which is of special importance in multiscale traffic modeling and simulation. The versatility of the algorithm--in contrast to algorithms dedicated to for example traffic assignment applications--makes it useful for a wide range of applications within the transportation domain and beyond. To support further research an open-source implementation of the algorithm is made available. Subject Multiscale graphcoarseninggeographic dataheuristicopensourcetransport networks To reference this document use: http://resolver.tudelft.nl/uuid:9d0c5347-09a3-41a7-9902-fe9210530a63 DOI https://doi.org/10.1109/TITS.2019.2912430 Embargo date 2019-10-29 ISSN 1524-9050 Source IEEE Transactions on Intelligent Transportation Systems, 21 (6), 2240-2253 Bibliographical note Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public. Part of collection Institutional Repository Document type journal article Rights © 2019 P.K. Krishnakumari, O. Cats, J.W.C. van Lint Files PDF 08701619.pdf 8.51 MB Close viewer /islandora/object/uuid:9d0c5347-09a3-41a7-9902-fe9210530a63/datastream/OBJ/view