mlsanityData to 14 Oct 2026

Transfer Learning Approach to Bicycle-sharing Systems' Station Location Planning using OpenStreetMap Data

arXiv 2111.00990 ↗First posted 1 Nov 2021cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Bicycle-sharing systems (BSS) have become a daily reality for many citizens of larger, wealthier cities in developed regions. However, planning the layout of bicycle-sharing stations usually requires expensive data gathering, surveying travel behavior and trip modelling followed by station layout optimization. Many smaller cities and towns, especially in developing areas, may have difficulty financing such projects. Planning a BSS also takes a considerable amount of time. Yet as the pandemic has shown us, municipalities will face the need to adapt rapidly to mobility shifts, which include citizens leaving public transport for bicycles. Laying out a bike sharing system quickly will become critical in addressing the increase in bike demand. This paper addresses the problem of cost and time in BSS layout design and proposes a new solution to streamline and facilitate the process of such planning by using spatial embedding methods. Based only 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 using the Uber H3 discrete global grid system and to indicate regions where it is worth placing a station based on existing systems in different cities using transfer learning. The result of the work is a mechanism to support planners in their decision making when planning a station layout with a choice of reference cities.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 1 of its 35 references that are in the map. First posted on arXiv 1 Nov 2021.

Builds on

1 of 35 references.

References · 1

  1. 2020Leveraging an Efficient and Semantic Location Embedding to Seek New Ports of Bike Share Servicescited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.