Finding Key Stations of Hangzhou Public Bicycle System by a Improved K-Means Algorithm

Abstract

In China, Hangzhou is the first city to set up the Public Bicycle System. Now, the System has been the largest bike- sharing program in the world. The software of Hangzhou Public Bicycle System was developed by our team. There are many and many technology problems in the decision of intelligent dispatch. Among of these problems, determining how to find the key stations to give special care is very important. In this paper, a improved k-means algorithm is used to recognize the key stations of Hangzhou Public Bicycle System. At first, by passing over the two week’s real data, a rent-return database is initialed. Then the algorithm builds minimum spanning tree and splits it to gets k initial cluster centers. The key stations are determined from the rent-return database by the algorithm. Practice examples and comparison with the traditional k-means algorithm are made. The results show that the proposed algorithm is efficient and robust. The research result has been applied in Hangzhou.