<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Journal Article</dc:product_type><dc:title>Interactive Bike Lane Planning using Sharing Bikes' Trajectories</dc:title><dc:creator>He, Tianfu; Bao, Jie; Ruan, Sijie; Li, Ruiyuan; Li, Yanhua; He, Hui; Zheng, Yu</dc:creator><dc:corporate_author/><dc:editor/><dc:description>Cycling as a green transportation mode has been promoted by many governments all over the world. As a result, constructing effective bike lanes has become a crucial task to promote the cycling life style, as well-planned bike lanes can reduce traffic congestions and safety risks. Unfortunately, existing trajectory mining approaches for bike lane planning do not consider one or more key realistic government constraints: 1) budget limitations, 2) construction convenience, and 3) bike lane utilization. In this paper, we propose a data-driven approach to develop bike lane construction plans based on the large-scale real world bike trajectory data collected from Mobike, a station-less bike sharing system. We enforce these constraints to formulate our problem and introduce a flexible objective function to tune the benefit between coverage of users and the length of their trajectories. We prove the NP-hardness of the problem and propose greedy-based heuristics to address it. To improve the efficiency of the bike lane planning system for the urban planner, we propose a novel trajectory indexing structure and deploy the system based on a parallel computing framework
(Storm) to improve the system’s efficiency. Finally, extensive experiments and case studies are provided to demonstrate the system efficiency and effectiveness.</dc:description><dc:publisher/><dc:date>2019-03-25</dc:date><dc:nsf_par_id>10098328</dc:nsf_par_id><dc:journal_name>IEEE Transactions on Knowledge and Data Engineering</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation>1 to 1</dc:page_range_or_elocation><dc:issn>1041-4347</dc:issn><dc:isbn/><dc:doi>https://doi.org/10.1109/TKDE.2019.2907091</dc:doi><dcq:identifierAwardId>1657350; 1831140</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>