A dynamic electric fence planning framework for dockless bike-sharing systems based on inventory prediction

被引:1
作者
Luo, Kang [1 ]
Song, Yancun [2 ,3 ,4 ]
Shi, Ziyi [4 ,5 ]
Yu, Qing [6 ]
Wang, Guanqi [1 ]
Shen, Yonggang [1 ]
机构
[1] Zhejiang Univ, Polytech Inst, Hangzhou 310015, Zhejiang, Peoples R China
[2] Zhejiang Univ, Polytech Inst, Hangzhou 310058, Peoples R China
[3] Zhejiang Univ, Inst Intelligent Transportat Syst, Hangzhou 310058, Peoples R China
[4] Zhejiang Prov Engn Res Ctr Intelligent Transportat, Hangzhou 310058, Peoples R China
[5] Zhejiang Univ, Inst Intelligent Transportat Syst, Coll Civil Engn & Architecture, Hangzhou 310058, Peoples R China
[6] Peking Univ, Shenzhen Grad Sch, Sch Urban Planning & Design, Shenzhen 518055, Peoples R China
关键词
Dockless bike-sharing system; Electric fence planning; Graph deep learning; Inventory prediction; LOCATION; STATIONS; DEMAND;
D O I
10.1016/j.cie.2024.110619
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
While dockless bike-sharing systems are growing in popularity due to their convenience, indiscriminate parking creates disorder in cities. To address this problem, this paper proposes a novel prediction-based approach for planning dynamic electric fences. These fences can adapt to dynamic usage patterns and efficiently guide parking behavior. First, graded clustering and spatial point integration algorithms are used to determine the locations of electric fence candidates. Second, initial parking and scheduling simulations are developed to calculate the inventory of each candidate. Finally, a spatiotemporal graph neural network is utilized to predict inventory and generate real-time deployment plans for electric fences. Case studies are conducted in two regions in Shanghai, China. Compared to a non-electric fence scenario, extensive experiments show that our framework can satisfy 98.6% of the parking demand and reduce spatial entropy by 15% within a reasonable walking distance. The results contribute to improving urban orderliness and promoting the sustainability of bike-sharing systems.
引用
收藏
页数:16
相关论文
共 54 条
[1]   A Systematic Review of Station Location Techniques for Bicycle-Sharing Systems Planning and Operation [J].
Bahadori, Mohammad Sadegh ;
Goncalves, Alexandre B. ;
Moura, Filipe .
ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2021, 10 (08)
[2]   Optimal locations for bikeshare stations: A new GIS based spatial approach [J].
Banerjee, Snehanshu ;
Kabir, Md. Muhib ;
Khadem, Nashid K. ;
Chavis, Celeste .
TRANSPORTATION RESEARCH INTERDISCIPLINARY PERSPECTIVES, 2020, 4
[3]   Examining the varying influences of built environment on bike-sharing commuting: Empirical evidence from Shanghai [J].
Bi, Hui ;
Li, Aoyong ;
Hua, Mingzhuang ;
Zhu, He ;
Ye, Zhirui .
TRANSPORT POLICY, 2022, 129 :51-65
[4]   Bicycle sharing station planning: From free-floating to geo-fencing [J].
Cai, Yutong ;
Ong, Ghim Ping ;
Meng, Qiang .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2023, 147
[5]   Contribution of shared bikes to carbon dioxide emission reduction and the economy in Beijing [J].
Cao, Yijie ;
Shen, Dan .
SUSTAINABLE CITIES AND SOCIETY, 2019, 51
[6]  
Çetinkaya C, 2017, SIGMA J ENG NAT SCI, V35, P535
[7]   Dynamic Cluster-Based Over-Demand Prediction in Bike Sharing Systems [J].
Chen, Longbiao ;
Zhang, Daqing ;
Wang, Leye ;
Yang, Dingqi ;
Ma, Xiaojuan ;
Li, Shijian ;
Wu, Zhaohui ;
Pan, Gang ;
Thi-Mai-Trang Nguyen ;
Jakubowicz, Jeremie .
UBICOMP'16: PROCEEDINGS OF THE 2016 ACM INTERNATIONAL JOINT CONFERENCE ON PERVASIVE AND UBIQUITOUS COMPUTING, 2016, :841-852
[8]   Predicting station level demand in a bike-sharing system using recurrent neural networks [J].
Chen, Po-Chuan ;
Hsieh, He-Yen ;
Su, Kuan-Wu ;
Sigalingging, Xanno Kharis ;
Chen, Yan-Ru ;
Leu, Jenq-Shiou .
IET INTELLIGENT TRANSPORT SYSTEMS, 2020, 14 (06) :554-561
[9]   LOCATION-ALLOCATION PROBLEMS [J].
COOPER, L .
OPERATIONS RESEARCH, 1963, 11 (03) :331-343
[10]   Setting Inventory Levels in a Bike Sharing Network [J].
Datner, Sharon ;
Raviv, Tal ;
Tzur, Michal ;
Chemla, Daniel .
TRANSPORTATION SCIENCE, 2019, 53 (01) :62-76