Station Importance Evaluation in Dynamic Bike-Sharing Rebalancing Optimization Using an Entropy-Based TOPSIS Approach

被引:11
作者
He, Mingjia [1 ,2 ]
Ma, Xinwei [1 ,2 ]
Jin, Yuchuan [3 ]
机构
[1] Hebei Univ Technol, Sch Civil & Transportat Engn, Tianjin 300401, Peoples R China
[2] Southeast Univ SEU, Sch Transportat, Nanjing 210000, Peoples R China
[3] KTH Royal Inst Technol, Sch Architecture & Built Environm, S-11428 Stockholm, Sweden
基金
中国国家自然科学基金;
关键词
Predictive models; Transportation; Vehicle dynamics; Meteorology; Computational modeling; Data models; Urban areas; Bike-sharing; short-term demand prediction; rebalancing demand; station importance; TOPSIS; REPOSITIONING PROBLEM; DEMAND; FRAMEWORK; VEHICLES; USAGE;
D O I
10.1109/ACCESS.2021.3063881
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As an eco-friendly travel mode, bike-sharing has prevailed around the world. However, the systems are imbalanced due to the asymmetric spatial and temporal distribution of user demand. Station prioritization strategies are needed to rebalance more shared bikes for more important stations. This paper proposes an evaluation method of station importance in dynamic bike-sharing rebalancing. Firstly, a short-term demand prediction model is applied to capture the temporal and spatial characteristics of bike-sharing trip data and predict bike-sharing demand at the station level. Based on the prediction results, the method of determining rebalancing quantity is proposed with consideration of bike-sharing usage throughout the rebalancing period. Then, three criteria are employed to evaluate the importance of bike-sharing stations, including rebalancing quantity, closeness to inventory threshold, and distance from the key station. An entropy-based Technique for Order of Preference by Similarity to the Ideal Solution (TOPSIS) approach is proposed to weigh different criteria and evaluate station importance. Furthermore, the experiments on bike-sharing data from Nanjing City demonstrate the effectiveness of the proposed methods. This research is helpful for operators and managers to dynamically rebalance shared bikes with high efficiency and improve the service quality of bike-sharing systems.
引用
收藏
页码:38119 / 38131
页数:13
相关论文
共 71 条
[31]   Short-term forecasting of passenger demand under on-demand ride services: A spatio-temporal deep learning approach [J].
Ke, Jintao ;
Zheng, Hongyu ;
Yang, Hai ;
Chen, Xiqun .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2017, 85 :591-608
[32]   Graph convolutional network approach applied to predict hourly bike-sharing demands considering spatial, temporal, and global effects [J].
Kim, Tae San ;
Lee, Won Kyung ;
Sohn, So Young .
PLOS ONE, 2019, 14 (09)
[33]   Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station [J].
Legros, Benjamin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (02) :740-753
[34]   A Multi-Categorical Probabilistic Approach for Short-Term Bike Sharing Usage Prediction [J].
Li, Duo ;
Zhao, Yifei .
IEEE ACCESS, 2019, 7 :81364-81369
[35]   Predicting station-level hourly demand in a large-scale bike sharing network: A graph convolutional neural network approach [J].
Lin, Lei ;
He, Zhengbing ;
Peeta, Srinivas .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2018, 97 :258-276
[36]   Station Site Optimization in Bike Sharing Systems [J].
Liu, Junming ;
Li, Qiao ;
Qu, Meng ;
Chen, Weiwei ;
Yang, Jingyuan ;
Xiong, Hui ;
Zhong, Hao ;
Fu, Yanjie .
2015 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2015, :883-888
[37]   A static free-floating bike repositioning problem with multiple heterogeneous vehicles, multiple depots, and multiple visits [J].
Liu, Ying ;
Szeto, W. Y. ;
Ho, Sin C. .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2018, 92 :208-242
[38]  
Ljubenkov D., 2020, P IEEE EUR TECHN ENG, P1
[39]   An effective memetic algorithm for the generalized bike-sharing rebalancing problem [J].
Lu, Yongliang ;
Benlic, Una ;
Wu, Qinghua .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 95
[40]  
Marte D. G., 2018, TECH REP