Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSchweimer, C-
dc.contributor.authorGeiger, BC-
dc.contributor.authorWang, M-
dc.contributor.authorGogolenko, S-
dc.contributor.authorMahmood, I-
dc.contributor.authorJahani, A-
dc.contributor.authorSuleimenova, D-
dc.contributor.authorGroen, D-
dc.identifier.citationSchweimer, C., Geiger, B.C., Wang, M., Gogolenko, S., Mahmood, I., Jahani, A., Suleimenova, D. and Groen, D. (2021) 'A route pruning algorithm for an automated geographic location graph construction', Scientific Reports, 2021, 11 (1), 11547, pp. 1-11. doi: 10.1038/s41598-021-90943-8.en_US
dc.descriptionSupplementary Information: The online version contains supplementary material available at Map data copyrighted OpenStreetMap contributors and available from
dc.description.abstractCopyright © The Author(s) 2021. Automated construction of location graphs is instrumental but challenging, particularly in logistics optimisation problems and agent-based movement simulations. Hence, we propose an algorithm for automated construction of location graphs, in which vertices correspond to geographic locations of interest and edges to direct travelling routes between them. Our approach involves two steps. In the first step, we use a routing service to compute distances between all pairs of L locations, resulting in a complete graph. In the second step, we prune this graph by removing edges corresponding to indirect routes, identified using the triangle inequality. The computational complexity of this second step is O(L3) , which enables the computation of location graphs for all towns and cities on the road network of an entire continent. To illustrate the utility of our algorithm in an application, we constructed location graphs for four regions of different size and road infrastructures and compared them to manually created ground truths. Our algorithm simultaneously achieved precision and recall values around 0.9 for a wide range of the single hyperparameter, suggesting that it is a valid approach to create large location graphs for which a manual creation is infeasible.en_US
dc.description.sponsorshipThe presented work was developed in the project HPC and Big Data Technologies for Global Systems (HiDALGO), under grant agreement No.824115. The Know-Center is funded within the Austrian COMET Program—Competence Centers for Excellent Technologies—under the auspices of the Austrian Federal Ministry for Climate Action, Environment, Energy, Mobility, Innovation and Technology, the Austrian Federal Ministry for Digital and Economic Affairs and by the State of Styria.en_US
dc.format.extent1 - 11-
dc.publisherSpringer Natureen_US
dc.rightsRights and permissions: Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit
dc.subjectcomputer scienceen_US
dc.subjectinformation technologyen_US
dc.titleA route pruning algorithm for an automated geographic location graph constructionen_US
dc.relation.isPartOfScientific Reports-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf2.03 MBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons