Station Decision Problem in Bicycle Ad Hoc Networks

Wen Ouyang · Chang Wu Yu · Kun-Ming Yu · Ko-Jui Lin · Jo-Heng Yu · Hsin-Wen Chang +2 more

4 citations0/0 files storedAutonomic and Trusted Computing

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Urban Transport and Accessibility Transportation Planning and Optimization Transportation and Mobility Innovations

Abstract

Biking has been more and more popular recently where public bicycle systems have been adopted in many cities around the world. However, to develop and design a successful public bicycle system is challenging. This work proposes a novel problem called Station Decision Problem for Bicycle Ad Hoc Networks. The problem is to find minimum number of stations while satisfying reach ability and richness conditions. A station decision (SD) algorithm using graph theory is provided with simulation conducted to prove the effectiveness of this method. A real site data is also plugged in to check the result of the SD algorithm.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 4 citations exist upstream.

References

2011A hub location inventory model for bicycle sharing system design: Formulation and solution 2009The role of smart bike-sharing systems in urban mobility 2007Job accessibility under the influence of information and communication technologies, in the Netherlands 2009The Design and Implementation of Public Bike Information System Based on Google Maps

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.