Abstract
Abstract 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 is to use both datasets to determine an optimal action plan for problem solving given a limited budget. First, problematic locations are clustered. Each cluster corresponds to an impediment. Impediments are then associated with trips using a distance function. The aim is to find out which impediments to solve under a given budget constraint in order to maximize the number of impediment free trips. Thereto the trip set is partitioned by matching each trip with the largest set of its affecting impediments. Solving all impediments in such set induces a cost and makes the associated part of trips impediment free. An optimizer is presented and evaluated.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
