Urban Bike Lane Planning with Bike Trajectories: Models, Algorithms, and
a Real-World Case Study
- URL: http://arxiv.org/abs/2008.09645v1
- Date: Fri, 21 Aug 2020 18:46:51 GMT
- Title: Urban Bike Lane Planning with Bike Trajectories: Models, Algorithms, and
a Real-World Case Study
- Authors: Sheng Liu, Zuo-Jun Max Shen, Xiang Ji
- Abstract summary: We study an urban bike lane planning problem based on the fine-grained bike trajectory data made available by smart city infrastructure such as bike-sharing systems.
As bike-sharing systems become widespread in the metropolitan areas over the world, bike lanes are being planned and constructed by many municipal governments to promote cycling and protect cyclists.
We develop tractable formulations and efficient algorithms to solve the large-scale optimization problem.
- Score: 13.781010691827072
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study an urban bike lane planning problem based on the fine-grained bike
trajectory data, which is made available by smart city infrastructure such as
bike-sharing systems. The key decision is where to build bike lanes in the
existing road network. As bike-sharing systems become widespread in the
metropolitan areas over the world, bike lanes are being planned and constructed
by many municipal governments to promote cycling and protect cyclists.
Traditional bike lane planning approaches often rely on surveys and heuristics.
We develop a general and novel optimization framework to guide the bike lane
planning from bike trajectories. We formalize the bike lane planning problem in
view of the cyclists' utility functions and derive an integer optimization
model to maximize the utility. To capture cyclists' route choices, we develop a
bilevel program based on the Multinomial Logit model. We derive structural
properties about the base model and prove that the Lagrangian dual of the bike
lane planning model is polynomial-time solvable. Furthermore, we reformulate
the route choice based planning model as a mixed integer linear program using a
linear approximation scheme. We develop tractable formulations and efficient
algorithms to solve the large-scale optimization problem. Via a real-world case
study with a city government, we demonstrate the efficiency of the proposed
algorithms and quantify the trade-off between the coverage of bike trips and
continuity of bike lanes. We show how the network topology evolves according to
the utility functions and highlight the importance of understanding cyclists'
route choices. The proposed framework drives the data-driven urban planning
scheme in smart city operations management.
Related papers
- Predicting Citi Bike Demand Evolution Using Dynamic Graphs [81.12174591442479]
We apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
In this paper, we attempt to apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
arXiv Detail & Related papers (2022-12-18T21:43:27Z) - Mapping suburban bicycle lanes using street scene images and deep
learning [0.0]
This thesis presents a method to create a map of bicycle lanes in a survey area by taking sample street scene images from each road.
A deep learning model that has been trained to recognise bicycle lane symbols is applied.
The method was applied to successfully build a map for a survey area in the outer suburbs of Melbourne.
arXiv Detail & Related papers (2022-04-27T04:56:26Z) - Bike Sharing Demand Prediction based on Knowledge Sharing across Modes:
A Graph-based Deep Learning Approach [8.695763084463055]
This study proposes a graph-based deep learning approach for bike sharing demand prediction (B-MRGNN) with multimodal historical data as input.
A multi-relational graph neural network (MRGNN) is introduced to capture correlations between spatial units across modes.
Experiments are conducted using real-world bike sharing, subway and ride-hailing data from New York City.
arXiv Detail & Related papers (2022-03-18T06:10:17Z) - Automated Detection of Missing Links in Bicycle Networks [0.15293427903448023]
We develop the IPDC procedure (Identify, Prioritize, Decluster, Classify) for finding the most important missing links in urban bicycle networks.
We first identify all possible gaps following a multiplex network approach, prioritize them according to a flow-based metric, decluster emerging gap clusters, and manually classify the types of gaps.
Our results show how network analysis with minimal data requirements can serve as a cost-efficient support tool for bicycle network planning.
arXiv Detail & Related papers (2022-01-10T15:35:14Z) - Transfer Learning Approach to Bicycle-sharing Systems' Station Location
Planning using OpenStreetMap Data [4.869953137750582]
This paper proposes a new solution to streamline and facilitate the process of such planning by using spatial embedding methods.
Based on publicly available data from OpenStreetMap, and station layouts from 34 cities in Europe, a method has been developed to divide cities into micro-regions.
arXiv Detail & Related papers (2021-11-01T14:56:49Z) - Euro-PVI: Pedestrian Vehicle Interactions in Dense Urban Centers [126.81938540470847]
We propose Euro-PVI, a dataset of pedestrian and bicyclist trajectories.
In this work, we develop a joint inference model that learns an expressive multi-modal shared latent space across agents in the urban scene.
We achieve state of the art results on the nuScenes and Euro-PVI datasets demonstrating the importance of capturing interactions between ego-vehicle and pedestrians (bicyclists) for accurate predictions.
arXiv Detail & Related papers (2021-06-22T15:40:21Z) - End-to-End Intersection Handling using Multi-Agent Deep Reinforcement
Learning [63.56464608571663]
Navigating through intersections is one of the main challenging tasks for an autonomous vehicle.
In this work, we focus on the implementation of a system able to navigate through intersections where only traffic signs are provided.
We propose a multi-agent system using a continuous, model-free Deep Reinforcement Learning algorithm used to train a neural network for predicting both the acceleration and the steering angle at each time step.
arXiv Detail & Related papers (2021-04-28T07:54:40Z) - Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems
using Multi-objective Reinforcement Learning [79.61517670541863]
How to use AI to provide efficient bicycle dispatching solutions based on dynamic bicycle rental demand is an essential issue for dockless PBS (DL-PBS)
We propose a dynamic bicycle dispatching algorithm based on multi-objective reinforcement learning (MORL-BD) to provide the optimal bicycle dispatching solution for DL-PBS.
arXiv Detail & Related papers (2021-01-19T03:09:51Z) - Dynamic Planning of Bicycle Stations in Dockless Public Bicycle-sharing
System Using Gated Graph Neural Network [79.61517670541863]
Dockless Public Bicycle-sharing (DL-PBS) network becomes increasingly popular in many countries.
redundant and low-utility stations waste public urban space and maintenance costs of DL-PBS vendors.
We propose a Bicycle Station Dynamic Planning (BSDP) system to dynamically provide the optimal bicycle station layout for the DL-PBS network.
arXiv Detail & Related papers (2021-01-19T02:51:12Z) - Deep Structured Reactive Planning [94.92994828905984]
We propose a novel data-driven, reactive planning objective for self-driving vehicles.
We show that our model outperforms a non-reactive variant in successfully completing highly complex maneuvers.
arXiv Detail & Related papers (2021-01-18T01:43:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.