E-Sharing: Data-driven Online Optimization of Parking Location Placement for Dockless Electric Bike Sharing

Pengzhan Zhou, Cong Wang, Yuanyuan Yang, Xin Wei
{"title":"E-Sharing: Data-driven Online Optimization of Parking Location Placement for Dockless Electric Bike Sharing","authors":"Pengzhan Zhou, Cong Wang, Yuanyuan Yang, Xin Wei","doi":"10.1109/ICDCS47774.2020.00059","DOIUrl":null,"url":null,"abstract":"The rise of dockless electric bike sharing becomes a new urban lifestyle recently. More than just the first-and-last mile, it offers a new modality of green transportation. However, in addition to the traditional re-balance and overcrowding problems, it also brings new challenges to urban management and maintenance. Due to the safety risks of batteries, customers are regulated to park at designated locations, which potentially causes dissatisfaction and customer loss. Meanwhile, service providers should charge those scattering low-energy batteries in time. To address these issues, we propose E-sharing, a two-tier optimization framework that leverages data-driven online algorithms to plan parking locations and maintenance. First, we balance the user dissatisfaction and the number of parking locations by minimizing their sum. To account for real-time dynamics while not losing track of the historical optimality, we propose an online algorithm based on its near-optimal offline solution. Second, we develop an incentive mechanism to motivate users to aggregate low-battery bikes together, saving the cost of bike charging. Our experiment based on the public dataset demonstrates that the online algorithm can minimize the cost from the conflicting objectives and incentive mechanism further reduces the maintenance cost by 47%.","PeriodicalId":158630,"journal":{"name":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS47774.2020.00059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The rise of dockless electric bike sharing becomes a new urban lifestyle recently. More than just the first-and-last mile, it offers a new modality of green transportation. However, in addition to the traditional re-balance and overcrowding problems, it also brings new challenges to urban management and maintenance. Due to the safety risks of batteries, customers are regulated to park at designated locations, which potentially causes dissatisfaction and customer loss. Meanwhile, service providers should charge those scattering low-energy batteries in time. To address these issues, we propose E-sharing, a two-tier optimization framework that leverages data-driven online algorithms to plan parking locations and maintenance. First, we balance the user dissatisfaction and the number of parking locations by minimizing their sum. To account for real-time dynamics while not losing track of the historical optimality, we propose an online algorithm based on its near-optimal offline solution. Second, we develop an incentive mechanism to motivate users to aggregate low-battery bikes together, saving the cost of bike charging. Our experiment based on the public dataset demonstrates that the online algorithm can minimize the cost from the conflicting objectives and incentive mechanism further reduces the maintenance cost by 47%.
电子共享:数据驱动的无桩共享电动自行车停车位置在线优化
最近,无桩共享电动自行车的兴起成为一种新的城市生活方式。这不仅仅是第一英里和最后一英里,它还提供了一种新的绿色交通方式。然而,除了传统的再平衡和过度拥挤问题之外,它也给城市管理和维护带来了新的挑战。由于电池存在安全隐患,客户被规定在指定地点停车,这可能会导致客户的不满和流失。同时,服务提供商应及时为分散的低能量电池充电。为了解决这些问题,我们提出了E-sharing,这是一个两层优化框架,利用数据驱动的在线算法来规划停车位置和维护。首先,我们通过最小化用户不满和停车位数量来平衡它们。为了在不丢失历史最优性的同时考虑实时动态,我们提出了一种基于其近最优离线解决方案的在线算法。第二,建立激励机制,鼓励用户将低电量自行车聚集在一起,节约自行车充电成本。我们基于公共数据集的实验表明,在线算法可以最小化冲突目标的成本,并且激励机制进一步降低了47%的维护成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信