Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/33255
Title: | Optimal bicycle trip impediments resolution by data fusion | Authors: | KNAPEN, Luk Holmgren, Johan |
Issue Date: | 2021 | Publisher: | Springer | Source: | Journal of Ambient Intelligence & Humanized Computing (print), 12 (1) , p. 103 -120 | Abstract: | We propose a method, whose purpose is to combine a set of GPS traces collected by bicyclists with a set of notifications of problematic situations to determine an optimal action plan for solving safety related problems in a t raffic network. In particular, we use optimization to determine which problem locations to resolve under a given budget constraint in order to maximize the number of impediment free trips. The method aims to suggest a priority of impediments to resolve, which would be manually infeasible. %A set of GPS traces for bicyclists and a set of notifications by bicyclists of problematic situations (spots identified by GPS records) had been collected independently. The data collection periods did not coincide but overlapped and none was contained in the other one. The aim of our work is to use both datasets to determine an optimal action plan for problem solving given a limited budget. The proposed method consists of two steps. First, problematic locations are clustered, where each cluster corresponds to a so-called impediment. Each impediment is associated with trips nearby using a distance function. The trip set is partitioned by matching each trip with the largest set of its affecting impediments. Solving all impediments associated with such a part induces a cost and makes the associated part of trips impediment free. The second step aims to find the set of impediments that can be solved with a given budget and that makes the maximum number of trips impediment free. A branch-and-bound optimizer for the second step is presented and evaluated. The clustering parameters affect the set of identified impediments and the extent of each of them. In order to evaluate the sensitivity of the result to the clustering parameters a technique is proposed to consistently estimate the impediment resolution cost. Our study aims to support the interactive urban designer to improve the urban bicycle road infrastructure. By providing a method to prioritize between impediments to resolve, it also aims to contribute to a safer and more attractive traffic situation for bicyclists. | Keywords: | bicyclist;GPS traces;impediment notification;clustering;branch-and-bound;data fusion | Document URI: | http://hdl.handle.net/1942/33255 | ISSN: | 1868-5137 | e-ISSN: | 1868-5145 | DOI: | 10.1007/s12652-020-02854-7 | ISI #: | 000612903900003 | Rights: | The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature 2021 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2022 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2020_jaihc_bicyclistDataFusion.pdf | Peer-reviewed author version | 11.93 MB | Adobe PDF | View/Open |
Knapen-Holmgren2021_Article_OptimalBicycleTripImpedimentsR.pdf Restricted Access | Published version | 4.37 MB | Adobe PDF | View/Open Request a copy |
WEB OF SCIENCETM
Citations
1
checked on Oct 13, 2024
Page view(s)
40
checked on Jul 4, 2022
Download(s)
18
checked on Jul 4, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.