摘要：In China, Hangzhou is the first city to establish 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 segment the stations into several sections to give different care is very important. In this paper, an improved k-means algorithm based on optimized simulated annealing is used to segment the stations of Hangzhou Public Bicycle System. The optimized simulated annealing(SA) algorithm is used to assign k-means initial cluster centers. 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.
