Research on Data Analysis and Dispatching Strategies of Shared Bicycles based on artificial intelligence technology
DOI:
https://doi.org/10.54097/y7b9r185Keywords:
Geohash Encoding and Decoding, K-means Clustering Algorithm, KNN Regression Model, Constrained and Open Traveling Salesman Problem.Abstract
In the context of the increasing popularity of shared bicycles, optimizing their dispatch during peak hours has become a crucial issue in urban traffic management. This study addresses the optimization of shared bicycle dispatch during peak hours, using data from Beijing. This paper began by cleaning and decoding a week’s dataset, then defined block activity values for different time periods to identify popular blocks during rush hours. Due to the small size and large number of blocks, this paper applied the K-means algorithm to group these into 34 larger blocks, then calculated activity during peak periods to identify popular large blocks. This paper selected six key attributes for feature extraction: user ID, starting point coordinates, departure time, day of the week, and bike type. This paper used KNN regression and a fully connected neural network to predict the destination's coordinates. After performing K-fold cross-validation, the KNN model showed better performance, with an average validation loss of 0.0293 compared to the neural network's 0.0308. To address bike distribution issues, this paper proposed a manual adjustment strategy to balance bike availability across blocks. Using the 30th popular large block during the morning rush hour, we constructed a periodic adjustment method with 15-minute intervals. This paper simplified the problem into a constrained open traveling salesman problem and used enumeration and greedy algorithms to find the optimal adjustment strategy. This approach aims to stabilize bike distribution across blocks through spatial transfers. In conclusion, this study offers a framework for optimizing bike dispatch during peak hours and provides a scalable solution for managing bike distribution in larger urban areas during both rush hours and non-working days.
Downloads
References
[1] Xu C, Ji J, Liu P. The station-free sharing bike demand forecasting with a deep learning approach and large-scale datasets [J]. Transportation research part C: emerging technologies, 2018, 95: 47 - 60.
[2] Bao L, Liu Z, Miao R, et al. Spatiotemporal clustering analysis of shared electric vehicles based on trajectory data for sustainable urban governance [J]. Journal of Cleaner Production, 2023, 412: 137373.
[3] Hu R, Zhang Z, Ma X, et al. Dynamic rebalancing optimization for bike-sharing system using priority-based MOEA/D algorithm [J]. IEEE Access, 2021, 9: 27067 - 27084.
[4] Li X, Wang X, Feng Z. Dynamic repositioning in bike-sharing systems with uncertain demand: An improved rolling horizon framework [J]. Omega, 2024, 126: 103047.
[5] Zhou Y, Li Q, Yue X, et al. A novel predict-then-optimize method for sustainable bike-sharing management: a data-driven study in China [J]. Annals of Operations Research, 2022: 1 - 33.
[6] Zheng Y, Hao Q, Wang J, et al. A Survey of Machine Learning for Urban Decision Making: Applications in Planning, Transportation, and Healthcare [J]. ACM Computing Surveys, 2024, 57 (4): 1 - 41.
[7] Petrov P. Practical approach for modifying existing geocoding system from equal angular to equal area[J]. Economics and computer science, 2023, 9 (2): 43 - 65.
[8] Ikotun A M, Ezugwu A E, Abualigah L, et al. K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data [J]. Information Sciences, 2023, 622: 178 - 210.
[9] Abu Alfeilat H A, Hassanat A B A, Lasassmeh O, et al. Effects of distance measure choice on k-nearest neighbor classifier performance: a review[J]. Big data, 2019, 7 (4): 221 - 248.
[10] Halder, Rajib Kumar, et al. Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications [J]. Journal of Big Data, 2024, 11 (1): 113.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Highlights in Science, Engineering and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







