Collaborative Route Plan for Parking Sites Selection in Bike-Sharing Systems

Abstract

In order to alleviate the traffic congestion caused by the bike-sharing system, the bicycles should be parked in designated parking sites, particularly around the hot scenic spots. A proper route, which guides the cyclers to select a vacant place among the sites to park the bike, is required. In this paper, the Expected Travel Distance (ETD) and the Probability of Successful Parking (PSP) are formulated to evaluate the routes, which will guide the users to travel all the parking sites. We exploit the Poisson process to model the increment of the bicycle number in the parking site and construct the travel tree for the route plan problem. To provide a proper route, we propose the GOR algorithm and the F-M method based on the travel tree. Through extensive simulations, our algorithms are compared with TSP in terms of ETD, PSP and the execution time.

Cite this work

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

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

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