Abstract

The emergence of the Free-Floating Bike Sharing System (FFBSSs) has brought convenience to the public and also posed new challenges to urban construction and management. Inspired by the ability of Markov chains to handle large volumes of data in Google’s PageRank algorithm, we propose a Markov-chain based approach to model the FFBSSs for capturing its macroscopic aggregated properties. The geohash based algorithm is proposed to divide a geography map into cells due to the non-stock feature of the FFBSSs. After this, the transition matrix of the Markov chain is built based on historical bike trip data. Spectral clustering properties and the characteristic that Kemeny constants can identify the critical regions are discussed. Then we use about 3.2 million bike trips real data of BJUT Beijing, China from Mobike to demonstrate its application in identifying clusters and critical stations. In our empirical study, three clusters are identified in the vicinity of the BJUT, one of which is further analyzed and then 10 critical cells corresponding to the major sites in the cluster are identified, which is in line with reality.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.