A Multiscale Approach for Free-Float Bike-Sharing Electronic Fence Location Planning: A Case Study of Shenzhen City

IF 2 4区 工程技术 Q2 ENGINEERING, CIVIL
Zhonghua Wei, Houqiang Ma, Yunxuan Li
{"title":"A Multiscale Approach for Free-Float Bike-Sharing Electronic Fence Location Planning: A Case Study of Shenzhen City","authors":"Zhonghua Wei,&nbsp;Houqiang Ma,&nbsp;Yunxuan Li","doi":"10.1155/2024/1783038","DOIUrl":null,"url":null,"abstract":"<p>As an emerging technological means for managing free-float bike-sharing parking, electronic fences have attracted increasing attention in major cities as a solution to the challenges posed by disorderly parking of free-float bikes. Existing research has predominantly focused on employing clustering methods from the perspectives of free-float bike-sharing companies and users to plan and deploy electronic fences. However, the results often deviate significantly from the actual phenomenon. Therefore, scientific location selection is particularly important to fully harness the effectiveness of electronic fences. This paper proposes a multiscale clustering method based on free-float bike-sharing parking features to determine the optimal locations for electronic fences. A multiobjective mixed-integer programming model is established to address the location planning problem of electronic fences, determining the planning positions, quantities, and areas of electronic fences. A case study is conducted using a local area free-float bike-sharing dataset from Shenzhen city to validate the effectiveness of the proposed method. Comparative results with traditional approaches solely relying on <i>K</i>-means or DBSCAN methods demonstrate that the proposed approach achieves efficient location selection, through multiscale fusion site selection in the study area of 1.5∗1 km, and only 25 electronic fences need to be planned and deployed, covering a total area of 1691.88 square meters, which can provide rational placement solutions and better utilize the effectiveness of electronic fences. This method can thus offer decision-making support for the planning and location selection of electronic fences in free-float bike-sharing systems.</p>","PeriodicalId":50259,"journal":{"name":"Journal of Advanced Transportation","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Transportation","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2024/1783038","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 0

Abstract

As an emerging technological means for managing free-float bike-sharing parking, electronic fences have attracted increasing attention in major cities as a solution to the challenges posed by disorderly parking of free-float bikes. Existing research has predominantly focused on employing clustering methods from the perspectives of free-float bike-sharing companies and users to plan and deploy electronic fences. However, the results often deviate significantly from the actual phenomenon. Therefore, scientific location selection is particularly important to fully harness the effectiveness of electronic fences. This paper proposes a multiscale clustering method based on free-float bike-sharing parking features to determine the optimal locations for electronic fences. A multiobjective mixed-integer programming model is established to address the location planning problem of electronic fences, determining the planning positions, quantities, and areas of electronic fences. A case study is conducted using a local area free-float bike-sharing dataset from Shenzhen city to validate the effectiveness of the proposed method. Comparative results with traditional approaches solely relying on K-means or DBSCAN methods demonstrate that the proposed approach achieves efficient location selection, through multiscale fusion site selection in the study area of 1.5∗1 km, and only 25 electronic fences need to be planned and deployed, covering a total area of 1691.88 square meters, which can provide rational placement solutions and better utilize the effectiveness of electronic fences. This method can thus offer decision-making support for the planning and location selection of electronic fences in free-float bike-sharing systems.

自由浮动共享单车电子围栏位置规划的多尺度方法:深圳市案例研究
作为管理自由浮动共享单车停放的新兴技术手段,电子围栏作为解决自由浮动共享单车无序停放带来的挑战的一种解决方案,在各大城市引起了越来越多的关注。现有研究主要侧重于从自由浮动共享单车公司和用户的角度出发,采用聚类方法来规划和部署电子围栏。然而,研究结果往往与实际现象存在较大偏差。因此,要充分发挥电子围栏的功效,科学的选址尤为重要。本文提出了一种基于自由浮动共享单车停放特征的多尺度聚类方法,以确定电子围栏的最佳位置。针对电子围栏的位置规划问题,建立了多目标混合整数编程模型,确定了电子围栏的规划位置、数量和面积。利用深圳市局部地区自由浮动共享单车数据集进行了案例研究,验证了所提方法的有效性。与传统的单纯依赖 K-means 或 DBSCAN 方法的比较结果表明,所提出的方法通过多尺度融合选址,在 1.51 千米的研究区域内实现了高效选址,只需规划和部署 25 个电子围栏,总面积达 1691.88 平方米,可以提供合理的布设方案,更好地发挥电子围栏的效能。因此,该方法可为自由浮动共享单车系统中电子围栏的规划和位置选择提供决策支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Advanced Transportation
Journal of Advanced Transportation 工程技术-工程:土木
CiteScore
5.00
自引率
8.70%
发文量
466
审稿时长
7.3 months
期刊介绍: The Journal of Advanced Transportation (JAT) is a fully peer reviewed international journal in transportation research areas related to public transit, road traffic, transport networks and air transport. It publishes theoretical and innovative papers on analysis, design, operations, optimization and planning of multi-modal transport networks, transit & traffic systems, transport technology and traffic safety. Urban rail and bus systems, Pedestrian studies, traffic flow theory and control, Intelligent Transport Systems (ITS) and automated and/or connected vehicles are some topics of interest. Highway engineering, railway engineering and logistics do not fall within the aims and scope of JAT.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信